Weighted Fair Bandwidth Allocation for Adaptive Flows
نویسندگان
چکیده
Abstract— In this paper, we propose a gateway algorithm supporting both weighted fairness and queue management. Though some algorithms are proposed for fairness with queue management in the literature, they do not concern about the flow weight. Our proposed algorithm classifies an incoming packet into a flow and drops it stochastically according to the queue length and the fair bandwidth share of the flow that the packet belongs to. Simulation experiments show that our proposal is fair as much as other competitive fair queueing algorithms and also successful in queue management.
منابع مشابه
An Adaptive Scheduling Scheme for Fair Bandwidth Allocation
Class-based service differentiation is provided in DiffServ networks. However, this differentiation will be disordered under dynamic traffic loads due to the fixed weighted scheduling. An adaptive weighted scheduling scheme is proposed in this paper to achieve fair bandwidth allocation among different service classes. In this scheme, the number of active flows and the subscribed bandwidth are e...
متن کاملAdaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks
In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کاملAn Efficient Scheme of General Weighted Fair Allocation for Enhanced Best-Effort Service in High Speed Networks
This research is focused on enhanced best-effort service, which provides the minimum bandwidth guarantee and distributes the available bandwidth fairly to packet flows in a high speed network. These goals can be reached when the bandwidth allocation is general weighted (GW) fair among the flows. GW fairness ensures the minimum rate for every flow and, furthermore, allocates the excess bandwidth...
متن کاملFair adaptive bandwidth allocation: a rate control based active queue management discipline q
Active queue management disciplines such as RED and its extensions have been widely studied as mechanisms for providing congestion avoidance, differentiated services and fairness between different traffic classes. With the emergence of new applications with diverse Quality-of-Service requirements over the Internet, the need for mechanisms that provide differentiated services has become increasi...
متن کاملA combined low Latency and Weighted Fair Queuing based Scheduling of an input-Queued Switch
Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...
متن کامل