The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Performance Comparison of Timestamp based Fair Packet Schedulers inServer Resource Utilization

서버자원 이용도 측면에서 타임스탬프 기반 공평 패킷 스케줄러의 성능 비교 분석

  • 김태준 (공주대학교 정보통신공학부) ;
  • 안효범 (공주대학교 정보통신공학부)
  • Published : 2006.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.

실시간 멀티미디어 응용의 서비스 품질을 보장하는 공평 패킷 스케줄링 알고리즘은 타임스탬프 계산시 사용되는 패킷의 기준시각 측면에서 종료시각 방식과 시작시각 방식으로 나뉜다. 전자는 트래픽 흐름의 예약속도 조정으로 원하는 레이턴시(latency) 값을 얻을 수 있어 IETF (Internet Engineering Task Force) 종합서비스 모델의 품질보장 라우터에 적용되었으나 인터넷 전화와 같이 흐름 속도가 낮지만 우수한 지연특성을 요구하는 트래픽의 경우 심각한 대역폭 손실이 발생하는 문제가 있다. 본 논문에서는 시작시각 방식을 품질보장 라우터에 적용하는 방안을 모색하기 위해 대역폭 및 페이로드(payload) 이용도 측면에서 두 가지 공평 패킷 스케줄링 방식의 성능특성을 비교 분석하였다. 분석결과 대역폭 이용도 측면에서 시작시각 방식이 우수하다는 것이 증명되었고, 모의실험결과 시작시각 방식이 최대 20%까지 높은 페이로드 이용도를 보였다.

Keywords

References

  1. X. Xiao and L. M. Ni, 'Internet QoS: A Big Picture,' IEEE Network, Vol.13, No.2, pp.8-18, 1999 https://doi.org/10.1109/65.768484
  2. A.K. Parekh, 'A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks,' PhD dissertation, Massachusetts Institute of Technology, 1992
  3. A. Demers, S. Keshav, and S. Shenker, 'Design and analysis of a fair queuing algorithm,' Proc. ACM SIGCOMM'89, pp. 1-12, 1989
  4. P. Goyal, H. M. Vin, and H. Cheng, 'Start-time fair queueing:A scheduling algorithm for integrated services packet switching networks,' IEEE/ACM Trans. Networking, Vol.5, No.5, pp.690-704, 1997 https://doi.org/10.1109/90.649569
  5. M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, 'Weighted round-robin cell multiplexing in a general-purpose ATM switch chip,' IEEE JSAC, Vol.9, pp.1265-1279, 1991 https://doi.org/10.1109/49.105173
  6. S. Shenker, C. Partridge, and R. Guerin, 'Specification of Guaranteed Quality of Service,' RFC 2212, IETF, 1997
  7. Do-Sung Jun, Jinwoo Choe and Alberto Leon-Garcia, 'Credit-based Processor Sharing for Decoupled Delay and Bandwidth Allocation,' IEEE Comm. Letters, Vol.5, No.4, pp.178-180, 2001 https://doi.org/10.1109/4234.917106
  8. Jens Schmitt. 'Optimal Network Service Curves under Bandwidth-Delay Decoupling,' IEE Electronics Letters, Vol. 38, No.6, pp.297-299, 2002 https://doi.org/10.1049/el:20020204
  9. S.J. Golestani, 'A Self-Clocked Fair Queuing Scheme for Broadband Applications,' Proc. IEEE INFOCOM '94, pp.636-646, 1994 https://doi.org/10.1109/INFCOM.1994.337677
  10. D. Stiliadis and A. Varma, 'Rate Proportional Servers: A Design Methodology for Fair Queueing Algorithms,' IEEE/ACM Trans. Networking, Vol.6, No.2, pp.164-174, 1998 https://doi.org/10.1109/90.664265
  11. D. Stiliadis and A. Varma, 'Efficient Fair Queuing Algorithms for Packet-Switched Networks,' IEEE/ACM Trans. Networking, Vol.6, No.2, pp.175-185, 1998 https://doi.org/10.1109/90.664266
  12. Dong-Yong KWAK,Nam-Seok KO,Hong-Shik PARK, 'Medium Starting Potential Fair Queueing for High-Speed Networks,' IEICE Trans. Communications, Vol.E87-B, No.1, pp.188-19, 2004
  13. Dong-Yong Kwak, Nam-Seok Ko, Bongtae Kim, and Hong-Shik Park,'A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time Computation Complexity,' ETRI Journal, Vol.25, No.6, pp.475-488, 2003 https://doi.org/10.4218/etrij.03.0102.0008
  14. H. Zhou, 'Real-Time Services over High Speed Network,' Ph.D Dissertation, Curtin University of Technology, Australia, 2002
  15. R. Geurin, and V. Peris, 'Quality-of-Service in packet networks: Basic mechanisms and directions,' Computer Networks, No.31, pp.169-189, 1999 https://doi.org/10.1016/S0169-7552(98)00261-X
  16. J. Xu and R. J. Lipton, 'On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms,' Proc. ACM SIGCOMM'2002, Pittsburgh, 2002
  17. M. H. MacDougall, 'Simulating Computer Systems, Techniques and Tools,' MIT Press, 1987