Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2002.9C.1.021

Fair Queuing Algorithm Minimizing Packet Delay in Enterprise Network  

Youn, Yeo-Hoon (고려대학교 대학원 컴퓨터학과)
Kim, Tai-Yun (고려대학교 컴퓨터학과)
Publication Information
The KIPS Transactions:PartC / v.9C, no.1, 2002 , pp. 21-30 More about this Journal
Abstract
Nowadays the fair queuing field is studied actively for solving the unfair queuing problem which degrades the service performance of various applications on network. Above all DRR is a scheme that has lower work complexity and can be implemented easily. It guarantees the fair service by serving each queue every round Service Quantum(SQ) that includes the service deficit of the previous round. But it increases the delay by the numbers of unnecessary resetting of SQ or round circulation for the service that have the packet size over maximum several kbyte. In this paper, We propose the method that sets SQ dynamically to minimize this problem and the method that minimizes the work complexity on processing of packet. The proposed scheme minimizes the delay on various applications in enterprise environment by setting SQ dynamically and processing the packet simply.
Keywords
Fair Queuing; DRR; Packet Scheduling; , Enterprise Environment;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Hemant M. Chaskar, U. Madhow, 'Fair scheduling with tunable latency: a round robin approach,' GIOBECOM (Global Telecommunications Conference), Vol.2, pp.1328-1333, 1999   DOI
2 O. Altintas, Y. Atsumi, T Yoshida, 'Urgency-based round robin: a new scheduling discipline for packet switching networks,' ICC(IEEE International Conference Communication), Vol.2, pp.1179-1184, 1998   DOI
3 Salil S. kanhere, Alpa B. Parekh and Harish Sethu, 'Fair and Efficient Packet Scheduling in Wormhole Networks,' Proc. of IPDPS(International Parallel and Distributed Processing Symposium), pp.623-631, 2000   DOI
4 Hakyong Kim, Yongtak Lee and Kiseon Kim, 'Fairness concept in terms of utilisation,' IEEE Electronics Letters, Vol.36, No.4, 17th Feb. 2000   DOI   ScienceOn
5 M. H. MacGregor, W. Shi, 'Deficits for bursty latencycritical flows: DRR++,' Proc. of ICON(IEEE International Conference), pp.287-293, 2000   DOI
6 유항재, 김태윤, '엔터프라이즈 환경에서의 멀티미디어 QoS 프레임춰크', 고려대학교 석사학위논문, 1999
7 Onur Altintas, Yukio Atsumi, Teruaki Yoshida, 'A note on fair queueing and best-effort service in the Internet,' IWS(Internet Workshop), pp.145-150, 1999   DOI
8 G. Hasegawa, T. Murata, H. Miyahara, 'Comparisons of packet scheduling algorithms for fair service among connections on the Internet,' Proc. of INFOCOM( Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies), Vol.3, pp.1253-1262, 2000   DOI
9 M. Shreedhar, G. Varghese, 'Efficient Fair Queuing Using Deficit Round-Robin,' IEEE/ACM Transaction, Vol.4, No. 3, pp.375-385, June, 1996   DOI   ScienceOn
10 Hui Zhang, 'Service disciplines for guaranteed performance service in packet-switching networks,' Proc. of IEEE, Vol. 83, Issue 10. pp.1374-1396, June, 1996   DOI   ScienceOn
11 김병철, 김태윤, '엔터프라이즈 환경에서 서비스 요구 사항을 니원하는 패킷 스케줄링 알고리즘', 정보과학회논문지: 정보통신, 제27권 제3호, 2000   과학기술학회마을
12 Erik. Nordmark, 'Contribution of packet sizes to packet and byte volumes,' Internet Draft. Jun. 1997
13 Igor B.H. de A. Alves, Jose F. de Rezende, Luis Felipe M. de Moraes, 'Evaluating Fairnes in Aggreagated Traffic Marking,' GLOBECOM'00, IEEE, Vol.1, pp.445-449, 2000   DOI
14 Christian Huitema, 'Routing in the internet,' Prentice Hall PTR, pp.27-61, 1995
15 G. Fairhurst, 'Maximum Transfer Unit (MTU),' Internet Draft, 1998