Instant Service Policy and Its Application to Deficit Round Robin

  • Jinoo Joung
  • Dongha Shin
  • Feifei Feng
  • Hongkyu Jeong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)


Many of scheduling algorithms that provide a predefined bandwidth to a traffic flow fall into a category of Latency-rate (\(\mathcal{LR}\)) server. A series of \(\mathcal{LR}\) servers can be viewed as a virtual node with an \(\mathcal{LR}\) server of the latency which is simply the summation of individual latencies of actual \(\mathcal{LR}\) servers. Deficit Round Robin (DRR) is such an \(\mathcal{LR}\) server and the simplest one to implement, so that it is adopted in many real systems. In this research we suggest a novel policy of Instant Service, which is applicable to any round-robin schedulers. We then apply this policy to DRR, make a variation called DRR with Instant Service (DRR-IS), and analyze it. We prove that the DRR-IS is still an \(\mathcal{LR}\) server. We calculate its latency and investigate its fairness characteristics. We demonstrate the DRR-IS, compared with DRR, provides about 30% better latency while have the same complexity and the same fairness.


Schedule Algorithm Busy Period Quantum Size Virtual Node Head Packet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Parekh, A., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Trans. Networking. 1(3), 344–357 (1993)CrossRefGoogle Scholar
  2. 2.
    Demers, A., Keshav, S., Shenker, S.: Analysis and Simulation of a Fair Queuing Algorithm. ACM SIGCOMM, 1–12 (1989)Google Scholar
  3. 3.
    Golestani, S.: A Self-clocked Fair Queueing Scheme for Broadband Applications. IEEE INFOCOM (1994)Google Scholar
  4. 4.
    Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round-robin. IEEE/ACM Trans. Networking 4(3), 375–385 (1996)CrossRefGoogle Scholar
  5. 5.
    Guo, C.: SRR, an O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks. ACM SIGCOMM (2001)Google Scholar
  6. 6.
    Ramabhadran, S., Pasquale, J.: Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay. ACM SIGCOMM, 239–249 (2003)Google Scholar
  7. 7.
    Yuan, X., Duan, Z.: FRR: a Proportional and Worst-Case Fair Round Robin scheduler. IEEE INFOCOM (2005)Google Scholar
  8. 8.
    Lenzini, L., Mingozzi, E., Shea, G.: Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers. IEEE/ACM Trans. Networking 12(4), 681–693 (2004)CrossRefGoogle Scholar
  9. 9.
    Kanhere, S.S., Sethu, H.: On the latency bound of deficit round robin. In: Proceedings of the ICCCN (2002)Google Scholar
  10. 10.
    Stiliadis, D., Varma, A.: Latency-Rate servers: A general model for analysis of traffic scheduling algorithms. IEEE/ACM Trans. Networking 6(5) (1998)Google Scholar
  11. 11.
    Stiliadis, D.: Traffic Scheduling in Packet-Switched Networks: Analysis, Design and Implementation. Ph.D. Dissertation. U.C. Santa Cruz (1996)Google Scholar
  12. 12.
    Residential Ethernet Study Group website,
  13. 13.
    Feng, F., Garner, G.M.: Meeting Residential Ethernet Requirements: A Simulation Study. IEEE 802.3 Residential Ethernet Study Group (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jinoo Joung
    • 1
  • Dongha Shin
    • 1
  • Feifei Feng
    • 2
  • Hongkyu Jeong
    • 2
  1. 1.Sangmyung UniversitySeoulKorea
  2. 2.Samsung Advanced Institute of TechnologyKiheungKorea

Personalised recommendations