Browse > Article

Analysis of the DRR with Improved Latency  

Joung, Ji-Noo (상명대학교 소프트웨어학부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.30, no.12B, 2005 , pp. 847-854 More about this Journal
Abstract
Many of scheduling algorithms that provide a pre-defined bandwidth to a traffic flow fall into a category of Latency-rate (LR) server, the delay of whose network can be simply calculated by adding up individual 'latencies' of each LR servers. Deficit Round Robin (DRR) is one of such LR servers and the simplest one to implement, so that it is adopted in many real systems. In this research we suggest an improved version of DRR, the DRR with Instant Service (DRR-IS), and analyze it. We have proved that the DRR-IS is still an LR sewer and have obtained its latency. The DRR-IS, compared with DRR, turns out to have the same complexity while provide about $30\%$ better latency.
Keywords
DRR; Scheduling; QoS; Delay bound; Latency;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. J. Golestani, 'A Self-clocked Fair Queue­ing Scheme for Broadband Applications', in Proc. IEEE INFOCOM, pp. 636-646, 1994
2 C. Guo, 'SRR, an O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks,' in ACM SIGCOMM'01, 2001
3 X. Yuan and Z. Duan, 'FRR: a Proportional and Worst-Case Fair Round Robin sched­uler', IEEE INFOCOM'05, 2005
4 S. S. Kanhere and H. Sethu, 'On the la­tency bound of deficit round robin' , in Proceedings of the ICCCN, Miami, Oct. 2002
5 D. Stiliadis and A. Varma, 'Latency-Rate servers: A general model for analysis of traffic scheduling algorithms', IEEE/ACM Trans. Networking, vol. 6, no. 5 Oct. 1998
6 M. Shreedhar and G. Varghese, 'Efficient fair queueing using deficit round-robin,' IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375 - 385, June 1996   DOI   ScienceOn
7 L. Lenzini, E. Mingozzi, and G. Shea, 'Tradeoffs between low complexity, low la­tency, and fairness with deficit round-robin schedulers,' IEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 681-693, Aug. 2004   DOI   ScienceOn
8 A. K. Parekh and R. G. Gallager, 'A gen­eralized processor sharing approach to flow control in integrated services networks: The single node case,' IEEE/ACM Trans. Net­working, vol. 1, no. 3, pp. 344 - 357, June 1993   DOI   ScienceOn
9 A. Demers, S. Keshav, and S. Shenker, 'Analysis and Simulation of a Fair Queuing Algorithm,' in ACM SIGCOMM, pp. 1-12, Sep. 1989
10 S. Ramabhadran and J. Pasquale, 'Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay,' in ACM SIGCOMM'03, pp. 239-249, 2003