Mun Kyung Kim , Seung Seob Park

The KIPS Transactions:PartC, Vol. 12, No. 5, pp. 695-700, Oct. 2005
10.3745/KIPSTC.2005.12.5.695,   PDF Download:

Abstract

To provide the fair rate and archieve 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 fuctions 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 FNE(Flow Number Estimatio), 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 differnet configurations and traffic source. Through the simulation results, we showed that CS-FNE algorithm can allocate fair bandwidth approximately than other algorithms. and CS-FNE is simpler than anyu per-flow basis queuing mechanisms and it can be easily implemented.

Statistics
Cite this article