LL-DRR: An efficient scheduling algorithm for packet networks

Tu Xiaodong; Li Lemin

Volume 24 Issue 3

Mar. 2002

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2002 > 24(3): 361-369

Tu Xiaodong, Li Lemin. LL-DRR: An efficient scheduling algorithm for packet networks[J]. Journal of Electronics & Information Technology, 2002, 24(3): 361-369.

Citation:

Tu Xiaodong, Li Lemin. LL-DRR: An efficient scheduling algorithm for packet networks[J]. Journal of Electronics & Information Technology, 2002, 24(3): 361-369.

Tu Xiaodong, Li Lemin. LL-DRR: An efficient scheduling algorithm for packet networks[J]. Journal of Electronics & Information Technology, 2002, 24(3): 361-369.

Citation:

Tu Xiaodong, Li Lemin. LL-DRR: An efficient scheduling algorithm for packet networks[J]. Journal of Electronics & Information Technology, 2002, 24(3): 361-369.

PDF( 1125 KB)

LL-DRR: An efficient scheduling algorithm for packet networks

Received Date: 2000-08-28
Rev Recd Date: 2001-01-11
Publish Date: 2002-03-19

Abstract

Abstract

A novel fair queuing algorithm LL-DRR(Low Latency Deficit Round Robin)is proposed in this paper, which is based on DRR (Deficit Round Robin) algorithm and suitable to schedule variable length packets. The simulation and theoretical analysis show that the delay performance of LL-DRR is much better than DRR, and the maximum packet delay of a session in LL-DRR is independent of the number of sessions. LL-DRR can support real time service. LL-DRR inherits the fairness of DRR on average throughput. LL-DRR is simple to implement and applicable to high speed networks.

FullText(HTML)

References(1)

References

H.Zhang,Service disciplines for guaranteed performance service in 1packet-switching networks,Proc.IEEE,1995,83(10),1374-1396.[2]M.Shreedhar,G.Varghese,Efficient fair queuing using deficit round robin,ACM SIGCOMM.,1995.25(4),231-242.[3]A.Demers,S.Keshav,S,Shenker,Analysis and simulation of a fair queuing algorithm,ACM SIGCOMM.,1989,19(4),1-13.[4]A.K.Parekh,R.G.Gallager,A generalized processor sharing aplproach to flow control in integrated services netwvorks,The single-node case,IEEE Trans.on Networking,1993,1(3),344-357.[5]D.C.Stephens,J.C.R.Bennett,H.Zhang,Implementing scheduling algorithms in high-speed networks,IEEE J.on SAC,Special Issue on Next Generation IP Switches and Routers,1999.17(6),1145-1158.[6]J.B.Nagle,On packet switches with infinite storage,IEEE Trans.on Communicaticns,1987.COM-35(4),435-438.[7]M.Katevenis,S.Sidiropoulos,C.Courcoubetis,WVeighted round-robin cell nmltiplexing in a general-purpose ATM switch chip,IEEE J.on SAC,1991,9(8),1265-1279.[8]J.C.R.Bennett,H.Zhang,WF2Q: WVorst-case fair weighted fair queuing,San Franeisco,IEEE Infocom,California,1996,120-128.[9]北京希望电脑公司,Cisco 1OS 12 0参考库-服务质量优化技术,北京希望电子出版社,1999,7、59-86.

Relative Articles

Supplements(0)

Cited By

Proportional views