Browse > Article

An Analysis Tool for Deriving Bounds on Delay and Buffer Size in Packet Networks  

편기현 (한국과학기술원 전기및전자공학)
송준화 (한국과학기술원 전자전산학과)
이흥규 (한국과학기술원 전자전산학과)
Publication Information
Journal of KIISE:Information Networking / v.30, no.5, 2003 , pp. 641-648 More about this Journal
Abstract
In this paper, we propose a general analysis tool that derives guaranteed delay bounds for real-time sessions when those sessions pass through heterogeneous schedulers in general packet networks. This tool characterizes each different scheduler by a homogeneous service curve server. We show that service curve servers can characterize a strictly larger class of schedulers than LR servers. That is, we can characterize not only all LR servers but also RC-EDF and SC scheduler by service curve servers. Even with such advantage over LR servers, service curve servers provide accurate analysis results. We prove mathematically that if we analyze a network that can be analyzed by both LR servers and service curve servers,,both cases yield the same delay bound.
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 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
3 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
4 D. Stiliadis and A. Varma, Latency-Rate Servers : A Gerneral Model for Analysis of Traffic Scheduling Algorthms, IEEE/ACM Tran. Networking, 6(5): 611-624, October 1998   DOI   ScienceOn
5 L. Zhang, VirtualClock: A New Traffic Control Algorithm for Packet Swithching Networks. ACM Transactions on Computer Systems, 9(2):101-124, May 1991   DOI
6 N. Figueira and J. Pasquale, An Uper Bound on Delay for the VirtualClock Service Discipline. IEEE/ACM Tran. Networking, 3(4):399-408, August 1995   DOI   ScienceOn
7 M. Shreedhar and George Varghese, Efficient Fair Queuing Using Deficit Round-Robin, IEEE/ACM Tran. Networking, 4(3):375-385, June 1996   DOI   ScienceOn
8 Debanjan Saha, Sarit Mukherjee, and Satich K. Tripahti, Multirate Scheduling of VBR Video Trac in ATM Networks, IEEE JSAC, 15(6): 1132-1147, August 1997   DOI   ScienceOn
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   DOI   ScienceOn
10 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
11 A.K.J. Parekh and R.G. Gallager, A Gerneralized 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
12 R.L. Cruz, Quality of Service Quarantees in Virtual Circuit Switched Networks. IEEE JSAC, 13(6):1048-1056, 1995   DOI   ScienceOn
13 Dallas E. Wrege, Edward W. Knightly, Hui Zhang, and Jorg Liebeherr, Deterministic Delay Bounds for VBR Video in Packet-Switching Network; Foundamental Limits and Practical Tradeoffs. IEEE/ACM Tran. Networking, 4(3):352-362, June 1996   DOI   ScienceOn
14 Ion Stoica, Hui Zhang, and T.S. Eugene Ng. A Hierachical Fair Service Curve Algorithm for Link-Sharing Real-Time and Priority Services. IEEE/ACM Tran. Networking, 8(2): 185-199, 2000   DOI   ScienceOn
15 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