An improvement of drr packet scheduling algorithm

Wu Xiang; Kong Hongwei; Wang Weizhang; Ge Ning; Feng Chongxi

Volume 25 Issue 5

May 2003

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2003 > 25(5): 704-710

Wu Xiang, Kong Hongwei, Wang Weizhang, Ge Ning, Feng Chongxi. An improvement of drr packet scheduling algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(5): 704-710.

Citation:

Wu Xiang, Kong Hongwei, Wang Weizhang, Ge Ning, Feng Chongxi. An improvement of drr packet scheduling algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(5): 704-710.

Wu Xiang, Kong Hongwei, Wang Weizhang, Ge Ning, Feng Chongxi. An improvement of drr packet scheduling algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(5): 704-710.

Citation:

Wu Xiang, Kong Hongwei, Wang Weizhang, Ge Ning, Feng Chongxi. An improvement of drr packet scheduling algorithm[J]. Journal of Electronics & Information Technology, 2003, 25(5): 704-710.

PDF( 666 KB)

An improvement of drr packet scheduling algorithm

Received Date: 2001-09-18
Rev Recd Date: 2002-06-13
Publish Date: 2003-05-19

Abstract

Abstract

In order to allocate the bandwidth more efficiently and simply, this paper analyzes the limitation of the DRR(Deficit Round Robin) algorithm in the packet switch, and proposes an algorithm based on deducting credit and interleaving the output packets. The improved algorithm lowers the scheduling overhead, smoothes the output burst and is very simple for hardware implementation. Analysis indicates the improved algorithm has better fairness over DRR, in many cases. Results from analysis show that the scheme is able to maintain bandwidth and is affected by the number of credits less.

FullText(HTML)

References(1)

References

L. Zhang.[J].Virtual clock: A new traffic control algorithm for packet switching networks, Proc. of ACM SIGCOMM90, NY: ACM Press.1990,:-[2]A.K. Parekh, R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single node case, IEEE/ACM Trans. on Networking, 1993, 1(3),344-357.[3]S.J. Golestani.[J].A self-clocked fair queueing scheme for broadband applications, Proc. of IEEE INFOCOM94[C], NJ: IEEE Press.1994,:-[4]J.C.R. Bennett.[J].H. Zhang, WF2Q: Worst-case Fair weighted Fair Queueing, Proc. of IEEE INFOCOM96, NJ: IEEE Press.1996,:-[5]M. Katevenis, S. Sidiropoulos, C. Courcoubetis, Weighted round-robin cell multiplexing in a general-purpose ATM switch chip, IEEE J. on Selected Areas in Communications, 1991, 9(8),1265-1279.[6]M. Shreedhar, G. Varghese, Efficient fair queueing using deficit round robin, IEEE/ACM Trans.on Networking, 1996, 4(3), 375-385.[7]D. Stiliadis, A. Varma, Latency-rate servers: A general model for analysis of traffic scheduling algorithms, IEEE/ACM Trans. on Networking, 1998, 6(5), 611-624.

Relative Articles

Supplements(0)

Cited By

Proportional views