ScholarLens Back to search
2004•Unpublished venueRequires access

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

Chonggang Wang, Bo Li, Y. Thomas Hou, Kazem Sohraby, Weiwen Tang

Open publisher page 4 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Goodput, Active queue management, Computer science, Queue, Queueing theory, Algorithm, Network packet, Overshoot (microwave communication)

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Design and analysis of a rate-based algorithm for active queue management — Research Paper | ScholarLens