Network queue scheduling algorithm based on self-similar traffic level grading prediction |
| |
Authors: | Debin WEI Ting SHEN Li YANG Yaowen QI |
| |
Affiliation: | 1. School of Automation,Nanjing University of Science and Technology,Nanjing 210094,China;2. School of Information Engineering,Dalian University,Dalian 116622,China;3. Communication and Network Laboratory,Dalian University,Dalian 116622,China |
| |
Abstract: | 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. |
| |
Keywords: | network traffic self-similarity grading prediction queue scheduling round robin |
|
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|