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

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

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

패킷 네트워크에서 지연과 버퍼 크기 한계를 추출할 수 있는 분석 도구

  • 편기현 (한국과학기술원 전기및전자공학) ;
  • 송준화 (한국과학기술원 전자전산학과) ;
  • 이흥규 (한국과학기술원 전자전산학과)
  • Published : 2003.10.01
Download PDF
⟨ Previous Next ⟩

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.

본 논문은 가변 패킷을 사용하는 일반적인 망에서 실시간 세션이 이종의 여러 스케줄러들을 통과할 때 네트워크가 보장하는 지연의 한계를 추출하는 범용 도구를 제안한다. 이 도구는 이질적인 각 스케줄러를 동질적인 서비스 곡선 서버로 특성화한다. 우리는 서비스 곡선 서버가 LR 서버보다 엄격히 큰 범주의 스케줄러들을 특성화할 수 있음을 보인다 즉, 모든 LR 서버는 서비스 곡선 서버로 특성화할 수 있고, 또한 RC-EDF와 SC 알고리즘조차도 서비스 곡선 서버로 정확히 특성화할 수 있음을 보인다. 이와 같이 서비스 곡선 서버는 LR 서버에 비해서 범용성 관점에서 큰 장점이 있으면서도 분석 결과가 정확하다. 우리는 LR 서버들로 분석할 수 있는 네트워크의 경우도 서비스 곡선 서버로 분석했을 때, 두 경우 모두 동일한 지연의 한계를 추출함을 수학적으로 증명한다.

Keywords

References

  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 https://doi.org/10.1109/90.298432
  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 https://doi.org/10.1109/90.649569
  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 https://doi.org/10.1109/90.731196
  5. 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 https://doi.org/10.1109/90.234856
  6. L. Zhang, VirtualClock: A New Traffic Control Algorithm for Packet Swithching Networks. ACM Transactions on Computer Systems, 9(2):101-124, May 1991 https://doi.org/10.1145/103720.103721
  7. 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 https://doi.org/10.1109/90.413214
  8. 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
  9. 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 https://doi.org/10.1109/90.532860
  10. 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 https://doi.org/10.1109/49.611164
  11. 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
  12. 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 https://doi.org/10.1109/ICC.2002.997028
  13. R.L. Cruz, Quality of Service Quarantees in Virtual Circuit Switched Networks. IEEE JSAC, 13(6):1048-1056, 1995 https://doi.org/10.1109/49.400660
  14. 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 https://doi.org/10.1109/90.502234
  15. 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 https://doi.org/10.1109/90.842141