DOI QR코드

DOI QR Code

A study on improving the bandwidth utilization of fair packet schedulers

공평 패킷 스케줄러의 대역폭 이용 효율 개선에 관한 연구

  • 김태준 (공주대학교 정보통신공학부) ;
  • 김황래 (공주대학교 컴퓨터공학부)
  • Published : 2006.06.01

Abstract

Most fair packet schedulers supporting quality-of-services of real-time multimedia applications are based on the finish time design scheme in which the expected transmission finish time of each packet is used as its timestamp. This scheme can adjust the latency of a flow with raising the flow's scheduling rate but it may suffer from severe bandwidth loss due to the coupled rate and delay allocation. This paper first introduces the concept of delay resource, and then proposes a scheduling method to improve the bandwidth utilization in which delay resource being lost due to the coupled allocation is transformed into bandwidth one. The performance evaluation shows that the proposed method gives higher bandwidth utilization by up to 50%.

실시간 멀티미디어 응용의 서비스 품질을 지원하는 공평 패킷 스케줄러는 대부분 패킷의 예상되는 전송 종료시점을 그 패킷의 타임스탬프로 사용하는 종료시각 방식을 채택하고 있다. 이 방식은 예약속도로 레이턴시를 통제할 수 있는 장점을 가지나 속도-지연 결합 특성으로 인해 스케줄러 대역폭의 이용 효율이 저하되는 문제점이 있다. 본 연구에서는 지연 자원 개념을 도입하고, 속도-지연 결합 특성에 의해 손실되는 지연 자원을 속도 자원으로 변환하여 스케줄러 대역폭의 이용 효율을 높이는 스케줄링 방식을 제안한다. 성능 평가 결과 기존 방식보다 50% 이상 우수한 대역폭 이용도 특성을 보였다.

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, Feb. 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, Specfication 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.DCurtin University of Technology, Australia, 2002
  15. 이은곤, '인터넷 전화 국내외 제도화 현황 및 정책적 시사점', 정보통신정책, 제16권, 제17호, pp.1-17, 2004
  16. M. H. MacDougall, Simulating Computer Systems, Techniques and Tools, MIT Press, 1987