Design and analysis of a rate-based algorithm for active queue management

This paper proposes a rate-based active queue management algorithm or RAQM. It uses the aggregated traffic input rate to calculate packet drop probability according to an exponential rule. We analyze the stability and investigate practical implementation issues of the RAQM. Simulations are carried o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:29th Annual IEEE International Conference on Local Computer Networks S. 206 - 213
Hauptverfasser: Chonggang Wang, Bo Li, Hou, Y.T., Sohraby, K., Weiwen Tang
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Los Alamitos CA IEEE 2004
IEEE Computer Society
Schlagworte:
Algorithm design and analysis
Applied sciences
Buffer overflow
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Contracts
Delay
Electronic mail
Exact sciences and technology
Probability
Queueing analysis
Robust stability
Software
Stability analysis
Traffic control
Queue length
Distributed system
Buffer system
Probabilistic approach
Queue
Delay
ISBN:9780769522609, 0769522602
ISSN:0742-1303
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper proposes a rate-based active queue management algorithm or RAQM. It uses the aggregated traffic input rate to calculate packet drop probability according to an exponential rule. We analyze the stability and investigate practical implementation issues of the RAQM. Simulations are carried out to study RAQM performance and to compare with other AQM algorithms, in particular PI and REM schemes. The results demonstrate that RAQM achieves better stability and faster response as it can quickly regulate the queue length to the expected value with small overshoot. RAQM also obtains better tradeoff between link utilization and queuing delay, and obtains higher goodput with the same buffer size as in PI and REM schemes. Finally RAQM has O(1) complexity, thus is independent of the number of flows.
ISBN:9780769522609
0769522602
ISSN:0742-1303
DOI:10.1109/LCN.2004.41