A Study on Fair Bandwidth Allocation in Core-Stateless Networks:Improved Algorithm and Its Evaluation
2
조회
0
다운로드
0
인용
0
참고문헌
초록
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 to 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.
참고문헌 (11)
- "Analysis and simulation of a fair queueing algorithm", pp.3~26 (1990)
- "A Study on Fair Bandwidth Allocation Based on FNE Algorithm in Core-Stateless Network", pp.77~82 (2003)
- "Explicit allocation of best-effort packet delivery service", pp.362~373 (1998)
- "Dynamics of random early detection", pp.1427~137 (1997)
- "Core-Stateless Fair Queueing Achieving Approximat -ely Fair Bandwidth Allocation in High Speed Networks," (1997)
- "Fair bandwidth share using flow number estimation", 2, pp.1274~1278 (2002)
- "a new traffic control algorithm for packet switching networks", pp.~90 (1990)
- "Efficient fair queueing using deficit round robin", pp.375~385 (1996)
- "A. A generalized processor sharing approach to flow control."
- "Random early detection for congestion avoidance", 1, pp.397~413 (1993)
- "Rainbow fair queueing fair bandwidth sharing without per-flow state", pp.922~931 (2000)