An Efficient Queue Management (EQM) technique for networks

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)1 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. © Springer-Verlag Berlin Heidelberg 2006.