A queue management algorithm for fair bandwidth allocation
نویسندگان
چکیده
In this thesis, a stateless active queue management algorithm called “PUNSI” which aims to achieve fair bandwidth allocation in congested routers is proposed. This algorithm prevents unresponsive flows from dominating available bandwidth shared with responsive flows by penalizing packets from unresponsive flows hopefully with a higher probability than those from responsive flows. It is motivated by the observation that unresponsive flows tend to generate more bursty traffic than responsive ones and that, when a packet is dropped due to buffer overflow, fellow packets from the same flow seem to be found in the buffer among those having joined recently. Simulation experiments show that the algorithm discards packets from unresponsive flows effectively and achieves pretty good fair share among flows with low implementation complexity.
منابع مشابه
A stateless active queue management scheme for approximating fair bandwidth allocation
We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...
متن کاملCHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation
We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By ...
متن کامل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 ...
متن کاملActive queue control scheme for achieving approximately fair bandwidth allocation
| We propose a bu®er management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the °ow with an estimated fair bandwidth share. Though V-WFQ is a hardwaree±cient...
متن کاملCHOKe a stateless active queue management scheme for approximating fair bandwidth allocation - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link i s a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the Rows which submit more packets/sec than is allowed by their fair share. By ...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Communications
دوره 30 شماره
صفحات -
تاریخ انتشار 2007