Browse > Article

A Study of Core-Stateless Mechanism for Fair Bandwidth Allocation  

Kim, Hwa-Suk (한국전자통신연구원 네트워크연구소 네트워크구조팀)
Kim, Sang-Ha (충남대학교 컴퓨터과학과 내트워크 연구실)
Kim, Young-Bu (한국전자통신연구원 네트워크연구소 네트워크구조팀)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.28, no.4C, 2003 , pp. 343-355 More about this Journal
Abstract
Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.
Keywords
Core-stateless; Fairness; CSFQ;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Zhai Mingyu, et al., ' Fair bandwidth allocat ions through queue management in core-stat eless networks,' Proceedings cf IEEE GLO BECOM2001. Vol. 4. pp.2248-2252 2001
2 V. Eleck, et al., 'Admission Control Based on End-to-End Measurements, Proceedings of IEEE INFOCOM2000, pp.623-630, 2000   DOI
3 Woo-Seop Rhee, et al., 'Two phase edge-to -edge distributed measurement based admissi on control mechanism in large IP networks,'GLOBECOM'01, Vo1.4, pp.2571-2575, 2001
4 Ion Stoica, et al., ' Core-Stateless Fair Que ueing: Achieving Approximately Fair Bandw idth Allocations in High Speed Networks,'Proceedings of ACM SIGCOMM'98, pp.118-130, 1998
5 A-Demers, et al., 'Analysis and Simulation of a Fair Queueing Algorithm,' Proceedings of ACM SIGCOMM'89, pp.3-12, Sep. 1989
6 lon Stoica, et al., 'Providing Guaranteed Ser vices Without Per Flow Management', Proc eedings cf SIGCOMM'99, pp.81-94, September 1999
7 Cellio Albuquerque, et al., 'Network Border Patrol,' Proceedings cf IEEE INFOCOM2000, Vol.l, pp.322-331, 2000
8 Ion Stoica, 'NS-2 Simulation for CSFQ,' http://www.cs.cmu.edu/~istoica/csfq, 1998
9 S.Floyd, 'Promoting the Use of End-to-End Congestion in the Internet,' IEEE/ACM Tr. on Networking, 7(4), pp.458-472, Aug. 1999   DOI   ScienceOn
10 UCB/LBNLMNT, 'Network Simulator - NS (Version 2),' http://www.isi.edu/nsnam/ns/
11 Antoine Clerget, et al.,'TUF: Tag-based Unified Faimess,' Proceedings cf IEEE IN FOCOM2001, Vo1.1, pp.498-507, 2001
12 Takashi Kunmoto, et al., ' Core-Stateless RED Algoiithm for Improving Faimess in a Best-Effort Network,' IEICE Tr. Com, E84-B(5), PP. 1413-1422, May 2001
13 Sally Floyd, et al., 'Random Early Detection for Congestion Avoidance,' IEEE/ACM Transaction on Networking, 1(4), PP.397-413,Tuly 1993   DOI   ScienceOn
14 M.Shreedhar, et al., 'Efficient Fair Queueing using Deficit Round Robin,' Proceedings of SIGC0MM'95, pp.231-243, Sep. 1995
15 Done Lin, et al., Dynamics of Random Early Detection,' In Proceedings of ACM SIGCOMM'97, 00.127-137, Oct. 1997
16 Ziruo Cao, et al., 'Rainbow Fair Queueing: F air Bandwidth Sharing without Per-Flow St ate,' Proceedings cf IEEE INFOCOM 2000, Vol. 2, pp. 922 -931, 2000   DOI