An Efficient Queue Management (EQM) Technique for Networks

  • Debessay Fesehaye Kassa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4268)


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.


Round Trip Time Link Capacity Bottleneck Link Random Early Detection Queue Management 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Border, K.C.: Fixed Point Theorems with Applications to Economics and Game Theory. Press Syndicate of the University of Cambridge, The Pitt Building, Trumpington Street, Cambridge, United Kingdom (1985)Google Scholar
  2. 2.
    Floyd, S., Jacobson, V.: Random Early Detection gateways for Congestion Avoidance. EEE/ACM Transactions on Networking 1(4), 397–413 (1993)CrossRefGoogle Scholar
  3. 3.
    Herings, J.J., van der Laan, G., Talman, D., Yang, Z.: A fixed point theorem for discontinuous functions. In: Tinbergen Institute Discussion Papers 05-004/1, Department of Econometrics and Tinbergen Institute, Vrije Universiteit, De Boelelaan 1105, 1081 HV, Amsterdam, The Netherlands (December 2004)Google Scholar
  4. 4.
    Katz, D., Kompella, K., Yeung, D.: RFC 3630 - Traffic Engineering (TE) Extensions to OSPF Version 2. rfc3630.txt, Berkeley, CA, USA (September 2003)Google Scholar
  5. 5.
    Stoica, I., Shenker, S., Zhang, H.: Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks. In: SIGCOMM, Vancouver, British Columbia, Canada (September 1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Debessay Fesehaye Kassa
    • 1
  1. 1.Department of TELINGhent UniversityGentBelgium

Personalised recommendations