Browse > Article

A Hierarchical Deficit Round-Robin Algorithm for Packet Scheduling  

Pyun Kihyun (전북대학교 전자정보공학부)
Cho Sung-Ik (전북대학교 전자정보공학부)
Lee Jong-Yeol (전북대학교 전자정보공학부)
Publication Information
Journal of KIISE:Information Networking / v.32, no.2, 2005 , pp. 147-155 More about this Journal
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.
Keywords
packet scheduling; fair service;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Golestani. A Self-Clocked Fair Queueing Scheme for Broadband Applications. In INFOCOM, pages 636-646, 1994   DOI
2 A. Demers, S. Keshav, and S. Shenkeer. Analysis and Simulation of a Fair Queueing Algorithm. In ACM SIGCOMM, pages 3-12, 1989   DOI
3 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   DOI   ScienceOn
4 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   DOI
5 Norival R. Figueira and Joseph Pasquale. A Schedulability Condition for Deadline-Ordered Service Disciplines. IEEE/ACM Tran. Networking, 5(2):232-244, April 1997   DOI   ScienceOn
6 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
7 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   DOI
8 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   DOI   ScienceOn
9 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   DOI   ScienceOn
10 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   DOI   ScienceOn
11 M. Shreedhar and George Varghese. Efficient Fair Queuing Using Deficit Round-Robin. IEEE/ACM Tran. Networking, 4(3):375-385, June 1996   DOI   ScienceOn
12 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
13 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
14 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   DOI   ScienceOn
15 J, H. Anderson, A. Block, and A. Srinivasan. Quick-Release Fair Scheduling. In Real-Time Systems Symposium, pages 130-141, 2003   DOI
16 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   DOI   ScienceOn
17 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   DOI
18 J,C.R. Bennett and H. Zhang. Hierarchical Packet Fair Queueing Algorithms. IEEE/ACM Tran. Networking, 5(5):675-689, October 1997   DOI   ScienceOn
19 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   DOI   ScienceOn
20 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   DOI   ScienceOn