Browse > Article

Service Curve Allocation Schemes for High Network Utilization with a Constant Deadline Computation Cost  

편기현 (한국과학기술원 전기 및 전자공학연구원)
송준화 (한국과학기술원 전산학과)
이흥규 (한국과학기술원 전산학과)
Publication Information
Journal of KIISE:Information Networking / v.30, no.4, 2003 , pp. 535-544 More about this Journal
Abstract
Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.
Keywords
Real-time service; guaranteed service; packet scheduling;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Shenker, C. Partridge, and R. Guerin. Specification of Guaranteed Quality of Service, September 1997. RFC 2212
2 H. Zhang. Service Disciplines for Guaranteed Performance Service in Packet Switching Net works. Proc. IEEE, 3(4):391 430, 1995
3 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
4 A. K. J. Parekh and R. G. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Service Net works: The Multiple Node Case. IEEE ACM Tran. Networking, 2(2):137-150, April 1994   DOI   ScienceOn
5 Dallas E. Wrege, Edward W. Knightly, Hui Zhang, and Jorg Liebeherr. Deterministic Delay Bounds for VBR Video in Packet Switching Net works: Fundamental Limits and Practical Trade Off. IEEE/ACM Tran. Networking, 4(3): 352 362, June 1990   DOI   ScienceOn
6 D. Ferrari and D. Verma. A Scheme for Real Time Channel Establishment in Wide Area Networks. IEEE JSAC. 8(4):368 379, April 1990   DOI   ScienceOn
7 Leonidas Georgiadis. Roch Guerin, 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
8 R. L. Cruz. Quality of Service Guarantees in Virtual Circuit Switched Networks. IEEE JSAC, 13(6):1048-1056, 1995   DOI   ScienceOn
9 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
10 J.C.R. Bennett and H. Zhang. Hierarchical Pacet Fair Queueing Algorithms. IEEE ACM Tran. Networking, 5(5):675-689, October 1997   DOI   ScienceOn
11 H. Zhang and D. Ferrari. Rate Controlled Service Disciplines. Journal of High Speed Networks, 3(4):389 412, 1994
12 J. Wroclawski. Specification of the Controlled Load Network Element Service, September 1997, RFC 2211
13 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
14 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
15 Leonidas Georgiadis, Roch Guerin, and Abhay Parekh. Optimal Multiplexing on a Single Link: Delay and Buffer Requirements. IEEE Trans. Information Theory, 43(5):1518-1535, September 1997   DOI   ScienceOn
16 A. Demers, S. Kesha, and S. Shenkeer. Analysis and Simulation of a Fair Queueing Algorithm. In ACM SIGCOMM, pages 3:12, 1989   DOI
17 Victor Firoiu, Jim Kurose, and Don Towsley, Efficient Admission Control of Piecewise Linear Traffic Envelopes at EDF Schedulers. IEEE/ACM Tran. Networking, 6(5):558-570, October 1998   DOI   ScienceOn
18 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
19 Kihyun Pyun, Junehwa Song, and Heung Kyu Lee. The Service Curve Service Discipline with the Service Curve Discipline for the Rate-Controlled EDF service discipline in Variable-Sized Packet Networks. In IEEE International Conference on Communications, pages 1135 1141, 2002   DOI
20 Kihyun Pyun. Junchwa Song, and Heung Kyu Lee. The Service Curve Service Discipline with the Service Curve for the Rate Controlled EDF service discipline in Variable Sized Packet Networks. Technical Report 01 11 002, Advanced Information Technical Research Center (AITrc), 2001
21 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
22 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