Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2005.12C.5.695

Fair Bandwidth Allocation in Core-Stateless Networks  

Kim Mun-Kyung (부경대학교 대학원)
Park Seung-Seob (부경대학교 전자컴퓨터정보통신공학부)
Publication Information
The KIPS Transactions:PartC / v.12C, no.5, 2005 , pp. 695-700 More about this Journal
Abstract
To provide the fair rate and achieve the fair bandwidth allocation, many per-flow scheduling algorithms have been proposed such as fair queueing algorithm for congestion control. But these algorithms need to maintain the state, manage buffer and schedule packets on a per-flow basis; the complexity of these functions may prevent them from being cost-effectively implemented. In this paper, therefore, to acquire cost-effectively for implementation, we propose a CS-FNE(Core Stateless FNE) algorithm that is based on FM(Flow Number Estimation), and evaluated CS-FNE scheme together with CSFQ(Core Stateless Fair Queueing), FRED(Fair Random Early Detection), RED(Random Early Detection), and DRR(Dynamic Round Robin) in several different configurations and traffic sources. Through the simulation results, we showed that CS-FNE algorithm can allocate fair bandwidth approximately than other algorithms, and CS-FNE is simpler than many per-flow basis queueing mechanisms and it can be easily implemented.
Keywords
Fairness, Scheduling; CSFQ; FRED; RED; DRR; CS-FNE;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 김화숙, 김상하, 김영부, '대역 공평성 보장을 위한 Core-Stateless 기법 연구', 한국통신학회 논문지, Vol.28, No.4C, 2003. 04   과학기술학회마을
2 서경현, 김문경, 육동철, 박승섭, ' Core-Statless 망에서의 공정한 대역？ 할당에 관한 연구', 제11회 한국정보과학회 영남지부 학술발표대회, pp.53-59, 2003. 12
3 L Zhang, 'Virtual clock: a new traffic control algori- thm for packet switching networks', in Proc. ACM, SIGCOMM 90, 1990, pp.19-29   DOI
4 S. Floyd and V. Jacobson, 'Random early detection for congestion avoidance', IEEE/ACM Trans. Networking, Vol.1, pp.397-413, July, 1993   DOI
5 NS simulator, available from http://www.isi.edu/nsnam/ns
6 M. Shreedhar and G. Varghese, 'Efficient fair queueing using deficit round robin', IEEE/ACM Trans. Networking, pp.375-385, June, 1996   DOI   ScienceOn
7 D.D. Clark and W. Fang, 'Explicit allocation of best-effort packet delivery service', IEEE Trans (1998), 362-373   DOI   ScienceOn
8 Jung-Shian Li and Ming-Shiann Leu, 'Fair bandwidth share using flow number estimation,' Communications, 2002. ICC 2002. IEEE International Conference on, Vol.2, pp.1274-1278, May, 2002   DOI
9 D. Lin andR. Morris, 'Dynamics of random early detection', in Proc. ACM SIGCOMM, Cannes, France, Oct.,1997, pp,1427-137   DOI
10 Parekh, A. A generalized processor sharing approach to flow control
11 Z. Cao, Z Wang, E. Zegura, 'Rainbow fair queueing: fair bandwidth sharing without per-flow state', Proceedings INFOCOM. March,2000, pp.922-931   DOI
12 A. Demers, S. Keshav, and S. Shenker ,'Analysis and simulation of a fair queueing algorithm', J. Internetw. Res. Experience, pp.3-26, Oct., 1990
13 Ion Stoica, Scott Shenker, and Hui Zhang, 'Core-Stateless Fair Queueing: Achieving Approximately Fair BAndwidth Allocation in High Speed Networks', in Proceeding of SIGCOMM'98, Oct., 1997   DOI