Network queue scheduling algorithm based on self-similar traffic level grading prediction

被引：0
|
作者：
Wei D. [1 ,2 ,3 ]
Shen T. [2 ,3 ]
Yang L. [2 ,3 ]
Qi Y. [1 ]
机构：
[1] School of Automation, Nanjing University of Science and Technology, Nanjing
[2] School of Information Engineering, Dalian University, Dalian
[3] Communication and Network Laboratory, Dalian University, Dalian
来源：
Tongxin Xuebao/Journal on Communications | 2020年 / 41卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Grading prediction; Network traffic; Queue scheduling; Round robin; Self-similarity;
D O I：
10.11959/j.issn.1000-436x.2020066
中图分类号：
学科分类号：
摘要：
Self-similarity characteristic of network traffic will lead to the continuous burstness of data in the network. In order to effectively reduce the queue delay and packet loss rate caused by network traffic burst, improve the transmission capacity of different priority services, and guarantee the service quality requirements, a queue scheduling algorithm P-DWRR based on the self-similarity of network traffic was proposed. A dynamic weight allocation method and a service quantum update method based on the self-similar traffic level grading prediction results were designed, and the service order of the queue according was determined to the service priority and queue waiting time, so as to reduce the queuing delay and packet loss rate. The simulation results show that the P-DWRR algorithm can reduce the queueing delay, delay jitter and packet loss rate on the basis of satisfying the different service priority requirements of the network, and its performance is better than that of DWRR and VDWRR. © 2020, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码：182 / 189
页数：7
相关论文
共 16 条
  • [1] Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated services networks-the single node case, Proceedings of INFOCOM'92, pp. 915-924, (1992)
  • [2] Shreedhar M., Varghese G., Efficient fair queuing using deficit round robin, IEEE/ACM Transactions on Networking, 4, 3, pp. 375-385, (1996)
  • [3] Wang S.L., Hou Y.B., Huang J.H., Et al., PFWRR: an enhanced WRR scheduling realizing the proportion fairness principle, Chinese Journal of Computers, 31, 5, pp. 775-782, (2008)
  • [4] Liu G.K., Fair and low-latency packet scheduling using successive minimal-weight round robin, Journal of Systems Science and Mathematical Sciences, 34, 9, pp. 1080-1099, (2014)
  • [5] Li B.Q., Zhan H.S., Wang Z.W., Et al., Performance analysis and improvement about WFQ and WRR scheduling algorithm, Transactions of Beijing Institute of Technology, 35, 3, pp. 316-320, (2015)
  • [6] Jiang W.J., Cai X.B., Research on queue scheduling algorithm based on diffserv, Computer Technology and Development, 25, 4, pp. 85-88, (2015)
  • [7] Bok P., Kohls K., Tuchelmann Y., Et al., I-DWRR-an insolvency enabled scheduling scheme extending Deficit Weighted Round Robin, The 3rd IEEE International Workshop on Management of Emerging Networks and Services, pp. 695-700, (2011)
  • [8] Ouni R., Bhar J., Torki K., A new scheduling protocol design based on deficit weighted round robin for QoS support in IP networks, Journal of Circuits, Systems, and Computers, 22, 3, pp. 1-21, (2013)
  • [9] Li C.C., Wang K., An SLA-aware load balancing scheme for cloud datacenters, 2014 International Conference on Information Networking (ICOIN), pp. 58-63, (2014)
  • [10] Leland W.E., Taqqu M.S., Willinger W., Et al., On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Transactions on Networking, 2, 1, pp. 1-15, (1994)
12