A Dredge Traffic Algorithm for Maintaining Network Stability

  • Yanan Zhao
  • Fusheng DaiEmail author
  • Jun Shi
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 517)


In order to solve the stability problem of communication network, network traffic instability is prevented, which is caused by local node or link failure. First, based on Lyapunov theory, a random queue model is established for communication network nodes to clear the traffic. Then, the factors are analyzed, which affects the network traffic stability. Finally, it proposes a dynamic scheduling multipath routing transmission algorithm to clear the network traffic steadily. Simulation and experimental results under the most unfavorable conditions of network stability, the performance of dynamic scheduling multipath route is verified to clear the traffic algorithm, which indicates that it is superior to traditional shortest path route dredging algorithm in ensuring network stability. It is proved that the dynamic scheduling multipath routing transmission algorithm can well suppress network turbulence by Lyapunov theory in the case of local network element failure, which ensures communication network stability.


Network stability Lyapunov Routing algorithm Network traffic Multipath transmission 


  1. 1.
    Yan, J., et al.: Integrated security analysis on cascading failure in complex networks. IEEE Press (2014)Google Scholar
  2. 2.
    Mei, D., et al.: Models of cascading failures based on complex networks theory. Comput. Dig. Eng. (2014)Google Scholar
  3. 3.
    Mahboub, A., et al.: Multi-zonal approach clustering based on stable election protocol in heterogeneous wireless sensor networks. In: IEEE International Colloquium on Information Science and Technology (2017)Google Scholar
  4. 4.
    Premkumar, H.C., et al.: Cognitive agent based stable routing protocol for vehicle-to-vehicle communication. In: IEEE India Conference, pp. 1–5 (2016)Google Scholar
  5. 5.
    Neely, M.J.: Universal scheduling for networks with arbitrary traffic, channels, and mobility. In: IEEE decision and control, pp. 1822–1829 (2012)Google Scholar
  6. 6.
    Neely, M.: Stochastic network optimization with application to communication and queueing systems. Synth. Lect. Commun. Netw. 3(1), 211 (2010)zbMATHGoogle Scholar
  7. 7.
    Tian-qi, G., et al.: Curve fitting method for closed discrete points. J. Jilin Univ. 45(2), 437–441 (2015)Google Scholar
  8. 8.
    Su, P., et al.: Energy-constrained dynamic scheduling and dynamic pricing algorithm in wireless cloud computing. Dianzi Yu Xinxi Xuebao/J. Electr. Inf. Technol. 39(5), 1150–1156 (2017)Google Scholar
  9. 9.
    Neely, M.J.: Stability and probability 1 convergence for queueing networks via lyapunov optimization. J. Appl. Math. 2012(1110-757X), 203–222 (2012)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Retchkiman Königsberg, Z.: Modeling stability analysis and scheduling design for a class of queuing systems by means of timed petri nets Lyapunov methods and max-plus algebra. Int. J. Pure Appl. Math. 77(3), 1457–1476 (2011)zbMATHGoogle Scholar
  11. 11.
    Min, C.: OPNET Network Simulation. Tsinghua University Press (2004)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Harbin Institute of Technology at WeihaiWeihaiChina
  2. 2.Science and Technology on Communication Networks LaboratoryShijiazhuangChina

Personalised recommendations