A Prioritized Nested DRR Algorithm

Jian Gui-zhou; Ge Ning; Feng Chong-xi

Volume 27 Issue 1

Jan. 2005

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2005 > 27(1): 123-126

Jian Gui-zhou, Ge Ning, Feng Chong-xi . A Prioritized Nested DRR Algorithm[J]. Journal of Electronics & Information Technology, 2005, 27(1): 123-126.

Citation:

Jian Gui-zhou, Ge Ning, Feng Chong-xi . A Prioritized Nested DRR Algorithm[J]. Journal of Electronics & Information Technology, 2005, 27(1): 123-126.

Jian Gui-zhou, Ge Ning, Feng Chong-xi . A Prioritized Nested DRR Algorithm[J]. Journal of Electronics & Information Technology, 2005, 27(1): 123-126.

Citation:

Jian Gui-zhou, Ge Ning, Feng Chong-xi . A Prioritized Nested DRR Algorithm[J]. Journal of Electronics & Information Technology, 2005, 27(1): 123-126.

PDF( 1074 KB)

A Prioritized Nested DRR Algorithm

Received Date: 2003-07-15
Rev Recd Date: 2003-12-11
Publish Date: 2005-01-19

Abstract

Abstract

As DRR fails to provide strong latency bound, in this paper, a new scheduling discipline named Prioritized Nested DRR (PNDRR) is presented, which introduces a token bucket with virtual allocated token quantum and changes the entering order of the scheduling list for the latency-critical flow. By using the scheme for the latency critical flow, delay of packet in latency critical queue is effectively diminished. In this paper, theoretical analyses prove that PN DRR results in a significant improvement in the latency bound of delay-sensitive traffic in comparison to nested DRR(NDRR) while preserves the good properties as the same relative fairness bound and the per-packet complexity of 0(1) as NDRR. Simulation results also support analysis.

FullText(HTML)

References(1)

References

Parekh A K, Gallager R G. A generalized processor sharing approach to flow control in integrated services networks: The single node case[J].IEEE/ACM Trans. on Networking.1993, 1(3):344-[2]Shreedhar M, Varghese G. Efficient fair queueing using deficit round robin[J].IEEE/ACM Trans. on Networking.1996, 4(3):375-[3]Macgregor M, Shi W. Deficit for bursty latency-critical flows:DRR++, IEEE International Conference on Networks, Singapore,2000:287 - 293.[4]Kanhere S S, Sethu H. Fair, efficient and low-latency packet scheduling using nested deficit round robin. 2001 IEEE Workshop on High Performance Switching and Routing,, Texas,USA, 2001:6 - 10.Mao J M, Moh W M, Wei B. PQWRR scheduling algorithm in supporting of DiffServ. International Communication Confrence,Amsterdam, the Netherlands, 2001:679 - 684.[5]Stiliadis D.[J].Varma A. Latency-rate servers: A general model for analysis of traffic scheduling algorithms. Proceedings of IEEE INFOCOM96, San Francisco, USA.1996,:-

Relative Articles

Supplements(0)

Cited By

Proportional views