The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Analysis of the DRR with Improved Latency

개선된 Latency의 DRR 분석

  • 정진우 (상명대학교 소프트웨어학부)
  • Published : 2005.12.01
Download PDF
⟨ Previous Next ⟩

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.

패킷 스위칭 네트워크 노드에서 정해진 대역폭을 보장해주는 스케줄링 기법 중 많은 수가 Latency-Rate (LR) server의 범주에 포함된다. LR server로 이루어진 네트워크는 각 노드에서의 latency의 합이 그대로 전체 네트워크의 latency가 된다는 성질을 가지고 있어서 각 노드의 latency를 구하면 전체 네트워크에서 겪을 수 있는 최대 delay를 쉽게 얻을 수 있다. Deficit Round Robin (DRR)은 이러한 LR server의 하나로 가장 구현이 간단하다는 장점 때문에 실제 여러 종류의 시스템에서 채택하였다. 본 연구에서는 이러한 DRR을 개선한 "DRR with Instant Service" (DRR-IS) 기법을 제시하고 분석하였다. DRR-IS가 LR server임을 증명하였고, 기존 DRR과 비교하며 전혀 복잡도의 증가가 없으면서 latency 성능은 $30\%$ 가량 향상되었음을 밝혀내었다.

Keywords

References

  1. A. Demers, S. Keshav, and S. Shenker, 'Analysis and Simulation of a Fair Queuing Algorithm,' in ACM SIGCOMM, pp. 1-12, Sep. 1989
  2. 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 https://doi.org/10.1109/90.234856
  3. S. J. Golestani, 'A Self-clocked Fair Queue­ing Scheme for Broadband Applications', in Proc. IEEE INFOCOM, pp. 636-646, 1994
  4. 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 https://doi.org/10.1109/90.502236
  5. C. Guo, 'SRR, an O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks,' in ACM SIGCOMM'01, 2001
  6. 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
  7. X. Yuan and Z. Duan, 'FRR: a Proportional and Worst-Case Fair Round Robin sched­uler', IEEE INFOCOM'05, 2005
  8. 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 https://doi.org/10.1109/TNET.2004.833131
  9. S. S. Kanhere and H. Sethu, 'On the la­tency bound of deficit round robin' , in Proceedings of the ICCCN, Miami, Oct. 2002
  10. 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