An efficient queue management (EQM) technique for networks

Authors:
Debessay Fesehaye Kassa
Affiliations:
Department of TELIN, Ghent University, Gent, Belgium
Venue:
IPOM'06 Proceedings of the 6th IEEE international conference on IP Operations and Management
Year:
2006

Citing 2
Cited 0

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper I present a simple and efficient queue management (EQM) technique based on optimal bandwidth allocation for networks. Each router calculates the bandwidth share (throughput) of each interfering flow at a link using link capacity and Interface IP Address (see RFC 3630) or round trip time (RTT) and congestion window size of the flows which are carried in the packets. The sources send packets and the routers in the path drop or allow the packets based on a certain probability and label the non-dropped packets with the allowable optimal throughput for the next round. Each router in the path modifies this label and the sources eventually adjust their sending rates based on the allowable throughput they get from the returning ACKs. In this way EQM finds the fair bandwidth allocation and gives fair queue management. I also a prove that EQM can converge to a stable point.