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

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

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

상수의 데드라인 계산 비용으로 높은 네트웍 유용도를 얻는 서비스 곡선 할당 방식

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

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.

통합 서비스망은 실시간 응용들에게 고품질의 서비스를 제공하기 위해서 종단간 지연의 한계를 보장해야 한다. 이러한 보장 서비스는 라우터의 출력 포트에 설치되는 실시간 스케줄러에 의해서 제공된다. 그러나 현재까지 연구된 스케줄링 알고리즘들은 네트워크 유용도 혹은 확장성(scalability)에 문제점을 갖고 있다. 여기서 네트워크 유용도는 얼마나 많은 실시간 세션들을 승인할 수 있는 지를 의미한다. 본 논문은 서비스 곡선 알고리즘에서 높은 네트러크 유용도와 확장성 양쪽을 모두 성취할 수 있는 서비스 곡선 할당 방식을 제안한다. 서비스 곡선 알고리즘의 가장 큰 특징은 서비스 곡선 할당 방식에 따라서 네트워크 유용도와 확장성 모두가 결정된다는 점이다. 일상적인 믿음과 반대로, 데드라인을 계산할 때 전체 서비스 곡선이 아닌 일부만이 사용됨을 증명한다. 이 사실로부터 우리는 데드라인을 계산하는 비용이 상수 시간인 서비스 곡선 할당 방식을 제안한다. 또한, 수치결과를 통해서 제안하는 방식이 mutirate 알고리즘을 포함한 GPS 알고리즘들보다 더 높은 네트워크 유용도를 성취함을 보인다. 우리가 아는 한, 서비스 곡선 알고리즘이 제안하는 서비스 곡선 할당 방식을 채용하면 동일한 확장성을 갖는 스케줄링 알고리즘들 중에 가장 놀은 네트워크 유용도를 성취한다.

Keywords

References

  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 https://doi.org/10.1109/90.234856
  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 https://doi.org/10.1109/90.298432
  5. J.C.R. Bennett and H. Zhang. Hierarchical Pacet Fair Queueing Algorithms. IEEE ACM Tran. Networking, 5(5):675-689, October 1997 https://doi.org/10.1109/90.649568
  6. 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 https://doi.org/10.1109/90.664265
  7. 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 https://doi.org/10.1109/49.611164
  8. H. Zhang and D. Ferrari. Rate Controlled Service Disciplines. Journal of High Speed Networks, 3(4):389 412, 1994
  9. D. Ferrari and D. Verma. A Scheme for Real Time Channel Establishment in Wide Area Networks. IEEE JSAC. 8(4):368 379, April 1990 https://doi.org/10.1109/49.53013
  10. 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
  11. R. L. Cruz. Quality of Service Guarantees in Virtual Circuit Switched Networks. IEEE JSAC, 13(6):1048-1056, 1995 https://doi.org/10.1109/49.400660
  12. 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 https://doi.org/10.1109/90.842141
  13. 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
  14. 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
  15. 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 https://doi.org/10.1109/90.502234
  16. J. Wroclawski. Specification of the Controlled Load Network Element Service, September 1997, RFC 2211
  17. 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
  18. 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 https://doi.org/10.1109/18.623149
  19. 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 https://doi.org/10.1109/90.731190
  20. A. Demers, S. Kesha, and S. Shenkeer. Analysis and Simulation of a Fair Queueing Algorithm. In ACM SIGCOMM, pages 3:12, 1989 https://doi.org/10.1145/75246.75248
  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 https://doi.org/10.1109/49.594841
  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 https://doi.org/10.1109/TCOMM.1994.577044