Journal of KIISE:Information Networking (한국정보과학회논문지:정보통신)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

A Hierarchical Deficit Round-Robin Algorithm for Packet Scheduling

패킷 스케쥴링을 위한 결손 보완 계층적 라운드로빈 알고리즘

  • 편기현 (전북대학교 전자정보공학부) ;
  • 조성익 (전북대학교 전자정보공학부) ;
  • 이종열 (전북대학교 전자정보공학부)
  • Published : 2005.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to realize a scalable implementation and high fairness simultaneously. Here high fairness means that bandwidth is distributed fairly even in short time intervals. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low fairness. In this paper, we propose a scheduling algorithm that can achieve feasible fairness without losing scalability. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR). While H-DRR requires a constant time for implementation, the achievable fairness is similar to that of Packet-by-Packet Generalized Processor Sharing(PGPS) algorithm. PGPS has worse scalability since it uses a sorted-priority queue requiring O(log N) implementation complexity where N is the number of sessions.

지난 십여년동안 각 세션에게 대역폭을 공평하게 분배하기 위한 많은 연구가 수행되었다. 이 문제에 있어서 가장 중요한 도전은 확장성 있는 구현(scalable implementation)을 실현하면서도 동시에 높은 공평성을 성취하는 것이다. 여기서 높은 공평성이란 작은 시간 구간에 대해서도 대역폭이 공평하게 분배되는 것이다. 불행히도 현존하는 스케줄링 알고리즘들은 확장성 있는 구현에 문제점이 있거나 혹은 공평성이 철저히 낮다는 결점을 갖고 있다. 본 논문에서 우리는 확장성을 잃지 않으면서도 동시에 합리적인 수준의 공평성을 제공하는 패킷 스케줄링 알고리즘을 제안한다. 제안하는 알고리즘은 결손을 보완하는 계층적 라운드-로빈 알고리즘이다. 계층적 라운드-로빈 알고리즘은 구현 복잡도가 상수 시간인 반면, 성취할 수 있는 공평성은 PGPS(Packet-by-Packet Generalized Processor Sharing) 알고리즘과 비슷함을 보인다. PGPS 알고리즘은 N을 세션 수라고 할 때 정렬된 우선 순위 큐를 사용하기 때문에 O(log N) 구현 복잡도를 가지므로 확장성이 떨어진다.

Keywords

References

  1. A. K. J. Parekh and R. G. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Service Networks: The Single Node Case. IEEE/ACM Tran. Networking, 1(3):344-357, June 1993 https://doi.org/10.1109/90.234856
  2. A. K. J. Parekh and R. G. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Service Networks: The Multiple Node Case. IEEE/ ACM Tran. Networking, 2(2):137-150, April 1994 https://doi.org/10.1109/90.298432
  3. J,C.R. Bennett and H. Zhang. Hierarchical Packet Fair Queueing Algorithms. IEEE/ACM Tran. Networking, 5(5):675-689, October 1997 https://doi.org/10.1109/90.649568
  4. Pawan Goyal, Harrick M. Vin, and Haichen Cheng. Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. IEEE/ACM Tran. Networking, 5(5):690-704, October 1997 https://doi.org/10.1109/90.649569
  5. D. Stiliadis and A. Varma. Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms. IEEE/ACM Tran. Networking, 6(2): 164-174, April 1998 https://doi.org/10.1109/90.664265
  6. Jeng Farn Lee, Yeali Sun, and Meng Chan Chen. On Maximum Rate Control of Weighted Fair Scheduling for Transactional Systems. In RealTime Systems Symposium, pages 335-344, 2003
  7. G. Kornaros, T. Orphanoudakis, and I. Papaefstathiou. GFS: An Efficient Implementation of Fair Scheduling for Multigigabit Packet Networks. In IEEE International Conference on Application-Specific Systems, Architectures, and Processors, pages 389-399, 2003
  8. J, H. Anderson, A. Block, and A. Srinivasan. Quick-Release Fair Scheduling. In Real-Time Systems Symposium, pages 130-141, 2003 https://doi.org/10.1109/REAL.2003.1253261
  9. Hanrijanto Sariowan, Rene L. Cruz, and George C. Polyzos. SCED: A Generalized Scheduling Policy for Guaranteeing Quality-of-Service. IEEE/ACM Tran. Networking, 7(5):669-684, October 1999 https://doi.org/10.1109/90.803382
  10. Ion Stoica, Hui Zhang, and T. S. Eugene Ng. A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services. IEEE/ ACM Tran. Networking, 8(2):185-199, 2000 https://doi.org/10.1109/90.842141
  11. Norival R. Figueira and Joseph Pasquale. A Schedulability Condition for Deadline-Ordered Service Disciplines. IEEE/ACM Tran. Networking, 5(2):232-244, April 1997 https://doi.org/10.1109/90.588088
  12. Massoud R. Hashemi and Alberto Leon-Garcia. The Single-Queue Switch: A Building Block for Switches with Programmable Scheduling. IEEE JSAC, 15(5):785-794, June 1997 https://doi.org/10.1109/49.594841
  13. P. Lavoie and Y. Savaria. A systolic architecture for fast stack sequential decoders. IEEE Tran. Communications, 42(2/3/4):324-335, Feb./Mar/Apr. 1994 https://doi.org/10.1109/TCOMM.1994.577044
  14. M. Shreedhar and George Varghese. Efficient Fair Queuing Using Deficit Round-Robin. IEEE/ACM Tran. Networking, 4(3):375-385, June 1996 https://doi.org/10.1109/90.502236
  15. C. R. Kalmanek, H. Kanakia, and S. Keshav. Rate Controlled Servers for Very High-Speed Networks. In IEEE Global Telecommunications Conference, pages 12-20, 1990 https://doi.org/10.1109/GLOCOM.1990.116472
  16. Hemant M. Chaskar and U. Madhow. Fair scheduling with tunable latency: A Round Robin approach. IEEE/ACM Tran: Networking, 11(4): 592-601, August 2003 https://doi.org/10.1109/TNET.2003.815290
  17. Salil S.Kanhere and Harish Sethu. Fair, Efficient and Low-Latency Packet Scheduling Using Nested Deficit Round Robin. In IEEE Workshop on High Performance Switching and Routing, pages 6-10, 2001 https://doi.org/10.1109/HPSR.2001.923594
  18. Kihyun Pyun. Packet Scheduling Algorithms to Provide Real-Time, Fair, and Link-Sharing Services in Integrated Services Networks. PhD thesis, Department of Electrical Engineering & Computer Science, Division of Computer Science, KAIST, February 2003
  19. S. Golestani. A Self-Clocked Fair Queueing Scheme for Broadband Applications. In INFOCOM, pages 636-646, 1994 https://doi.org/10.1109/INFCOM.1994.337677
  20. A. Demers, S. Keshav, and S. Shenkeer. Analysis and Simulation of a Fair Queueing Algorithm. In ACM SIGCOMM, pages 3-12, 1989 https://doi.org/10.1145/75246.75248