Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2006.13C.2.203

Performance Comparison of Timestamp based Fair Packet Schedulers inServer Resource Utilization  

Kim Tae-Joon (공주대학교 정보통신공학부)
Ahn Hyo-Beom (공주대학교 정보통신공학부)
Publication Information
The KIPS Transactions:PartC / v.13C, no.2, 2006 , pp. 203-210 More about this Journal
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%.
Keywords
Packet Scheduler; Fair Queuing; Fairness; Latency; Utilization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. Zhou, 'Real-Time Services over High Speed Network,' Ph.D Dissertation, Curtin University of Technology, Australia, 2002
2 R. Geurin, and V. Peris, 'Quality-of-Service in packet networks: Basic mechanisms and directions,' Computer Networks, No.31, pp.169-189, 1999   DOI   ScienceOn
3 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
4 M. H. MacDougall, 'Simulating Computer Systems, Techniques and Tools,' MIT Press, 1987
5 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   DOI   ScienceOn
6 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   DOI   ScienceOn
7 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
8 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   DOI   ScienceOn
9 S. Shenker, C. Partridge, and R. Guerin, 'Specification of Guaranteed Quality of Service,' RFC 2212, IETF, 1997
10 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   DOI   ScienceOn
11 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   DOI   ScienceOn
12 Jens Schmitt. 'Optimal Network Service Curves under Bandwidth-Delay Decoupling,' IEE Electronics Letters, Vol. 38, No.6, pp.297-299, 2002   DOI   ScienceOn
13 A. Demers, S. Keshav, and S. Shenker, 'Design and analysis of a fair queuing algorithm,' Proc. ACM SIGCOMM'89, pp. 1-12, 1989
14 S.J. Golestani, 'A Self-Clocked Fair Queuing Scheme for Broadband Applications,' Proc. IEEE INFOCOM '94, pp.636-646, 1994   DOI
15 X. Xiao and L. M. Ni, 'Internet QoS: A Big Picture,' IEEE Network, Vol.13, No.2, pp.8-18, 1999   DOI   ScienceOn
16 A.K. Parekh, 'A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks,' PhD dissertation, Massachusetts Institute of Technology, 1992
17 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   DOI   ScienceOn