Browse > Article

A Hierarchical Round-Robin Algorithm for Rate-Dependent Low Latency Bounds in Fixed-Sized Packet Networks  

Pyun Kihyun (전북대학교 전자정보공학부)
Publication Information
Journal of KIISE:Information Networking / v.32, no.2, 2005 , pp. 254-260 More about this Journal
Abstract
In the guaranteed service, a real-time scheduling algorithm must achieve both high level of network utilization and scalable implementation. Here, network utilization indicates the number of admitted real-time sessions. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low network utilization. For example, scheduling algorithms based on time-stamps have the problem of O(log N) scheduling complexity where N is the number of sessions. On the contrary, round-robin algorithms require O(1) complexity. but can achieve just a low level of network utilization. In this paper, we propose a scheduling algorithm that can achieve high network utilization without losing scalability. The proposed algorithm is a Hierarchical Round-Robin (H-RR) algorithm that utilizes multiple rounds with different interval sizes. It provides latency bounds similar to those by Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm using a sorted-Priority queue. However, H-RR requires a constant time for implementation.
Keywords
Real-time service; guaranteed service; packet scheduling; scafability;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 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
3 M. Shreedhar and George Varghese. Efficient Fair Queuing Using Deficit Round-Robin. IEEE/ACM Tran. Networking, 4(3):375-385, June 1996   DOI   ScienceOn
4 Pawan Goyal and Harrick M. Vin. Generalized Guaranteed Rate Scheduling Algorithms: A Framework. IEEE/ACM Tran. Networking, 5(4):561-571, August 1997   DOI   ScienceOn
5 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
6 Debanjan Saha, Sarit Mukherjee, and Satish K. Tripathi. Multirate Scheduling of VBR Video Traffic in ATM Networks. IEEE JSAC, 15(6): 1132-1147, August 1997   DOI   ScienceOn
7 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
8 D. Stiliadis and A. Varma. Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms. IEEE/ACM Tran. Networking, 6(5):611-624, October 1998   DOI   ScienceOn
9 J.C.R. Bennett and H. Zhang. Hierarchical Packet Fair Queueing Algorithms. IEEE/ACM Tran. Networking, 5(5):675-689, October 1997   DOI   ScienceOn
10 S. Golestani. A Self-Clocked Fair Queueing Scheme for Broadband Applications. In INFOCOM, pages 636-646, 1994   DOI
11 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
12 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
13 Pawan Goyal. Packet Scheduling Algorithms for Integrated Services Networks. PhD thesis, The University of Texas at Austin, August 1997
14 Jon C.R. Bennett and Hui Zhang. WF2Q: Worst-Case Fair Weighted Fair Queueing. In INFOCOM, pages 120-128, 1996   DOI
15 Leonidas Georgiadis, Roch Gu'erin, Vinod Peris, and Kumar N. Sivarajan, Efficient Network QoS Provisioning Based on per Node Traffic Shaping. IEEE/ACM Tran. Networking, 4(4):482-501, August 1996   DOI   ScienceOn
16 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):137-150, April 1994   DOI   ScienceOn
17 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
18 N. Figueira and J. Pasquale. An Upper Bound on Delay for the Virtual-Clock Service Discipline. IEEE/ACM Tran. Networking, 3(4):399-408, August 1995   DOI   ScienceOn
19 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
20 S. Jamaloddin Golestani. Network Delay Analysis of a Class of Fair Queueing Algorithms. IEEE JSAC, 13(6):1057-1070, August 1995   DOI   ScienceOn
21 William Stallings, High-Speed Networks: TCP/IP and ATM Design Principles. Prentice Hall, 1998
22 H. Zhang. Service Disciplines for Guaranteed performance Service in Packet-Switching Networks. Proc. IEEE, 3(4):391-430, 1995   DOI   ScienceOn
23 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
24 S. Shenker, C. Partridge, and R. Guerin, Specification of Guaranteed Quality of Service, September 1997. RFC 2212