JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A Study on Fair Bandwidth Allocation in Core-Stateless Networks: Improved Algorithm and Its Evaluation
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Study on Fair Bandwidth Allocation in Core-Stateless Networks: Improved Algorithm and Its Evaluation
Kim, Mun-Kyung; Seo, Kyoung-Hyun; Yuk, Dong-Cheol; Park, Seung-Seob;
  PDF(new window)
 Abstract
In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal : implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.
 Keywords
Fairness;Scheduling;CSFQ;FRED;RED;DRR;CS-FNE;
 Language
English
 Cited by
 References
1.
Demers, A., Keshav, S., and Shenker, S., (1990) 'Analysis and simulation of a fair queueing algorithm,' J. Internetw. Res. Experience, pp. 3-26

2.
Yuk, Dong-Cheol, Park, Seung-Seob, (2003) 'A Study on Fair Bandwidth Allocation Based on FNE Algorithm in Core-Stateless Network,' Korean Institute of Navigation and Port Reaserch, Fall Conference, pp.77-82 (Korean)

3.
Clark, D. D. and Fang, W.(1998), 'Explicit allocation of best-effort packet delivery service,' IEEE Trans, 362-373

4.
Lin, D. and Morris, R., (1997) 'Dynamics of random early detection,' in Proc. ACM SIGCOMM, Cannes, France, pp. 1427-137

5.
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

6.
Li, Jung-Shian and Leu, Ming-Shiann, (2002) 'Fair bandwidth share using flow number estimation,' Communications, 2002. ICC 2002. IEEE International Conference on, Vol. 2, pp. 1274-1278

7.
Zhang, L.(1990), 'Virtual clock: a new traffic control algorithm for packet switching networks,' in Proc. ACM, SIGCOMM 90, pp. 19-29

8.
Shreedhar, M. and Varghese, G., (1996) 'Efficient fair queueing using deficit round robin,' IEEE/ACM Trans. Networking, pp. 375-385

9.
NS simulator, available from http://www.isi.edu/ nsnarn/ns

10.
Parekh, A. A generalized processor sharing approach to flow control

11.
Floyd, S. and Jacobson, V., (1993) 'Random early detection for congestion avoidance,' IEEE/ACM Trans. Networking, Vol. 1, pp. 397-413 crossref(new window)

12.
Cao, Z., Wang, Z., Zegura, E., (2000) 'Rainbow fair queueing: fair bandwidth sharing without per-flow state', Proceedings INFOCOM. pp. 922-931