A Dynamic Round-robin Packet Scheduling Algorithm

摘要：

　　This paper puts forward a new dynamic round-robin (DYRR) packet schedufing algorithm with high efficiency and good fairness.DYRR algorithm introduces dynamic round-robin concept,that is,the allowance given to each of the flows in a given round is not fixed,but is related with the number of bytes sent of this and other flows of the last round scheduling.The time complexity of the DYRR algorithm is 0(1).Results from performance simulation analysis shows that DYRR algorithm can effectively smooth output burst,realize fair scheduling,and have a good time delay characteristic.

关键词： scheduling dynamic round-robin fairness burs

作者: Yong He Lei Gao Guikai Liu Yuzhen Liu

作者单位: School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan,Hunan,411201,P.R.China

会议类型: 国际会议

会议名称: 2013 2nd International Conference on Computer Science and Electronics Engineering(ICCSEE2013)(2013年第二届计算机科学与电子工程国际会议)

会议地点: 杭州

会议语种:英文

页码: 2709-2712

在线出版日期: 2013-03-22（万方平台首次上网日期，不代表论文的发表时间）