Analysis and design of an Adaptive Virtual Queue (AVQ) algorithm for active Queue management

Srisankar Kunniyur, Rayadurgam Srikant

Research output: Contribution to journalConference article

Abstract

Virtual Queue-based marking schemes have been recently for AQM (Active Queue Management) in Internet routers. We consider a particular scheme, which we call the Adaptive Virtual Queue (AVQ), and study its following properties: stability in the presence of feedback delays, its ability to maintain small queue lengths and its robustness in the presence of extremely short flows (the so-called web mice). Using a mathematical tool motivated by the earlier work of Hollot et al, we present a simple rule to design the parameters of the AVQ algorithm. We then compare its performance through simulation with several well-known AQM schemes such as RED, REM, PI controller and a non-adaptive virtual queue algorithm. With a view towards implementation, we show that AVQ can be implemented as a simple token bucket using only a few lines of code.

Original languageEnglish (US)
Pages (from-to)123-134
Number of pages12
JournalComputer Communication Review
Volume31
Issue number4
DOIs
StatePublished - Oct 31 2001
EventACM SIGCOMM 2001- Applications, Technologies, Architectures, and Protocols for Computers Communications- - San Diego, CA, United States
Duration: Aug 27 2001Aug 31 2001

Fingerprint

Routers
Internet
Feedback
Controllers

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

Analysis and design of an Adaptive Virtual Queue (AVQ) algorithm for active Queue management. / Kunniyur, Srisankar; Srikant, Rayadurgam.

In: Computer Communication Review, Vol. 31, No. 4, 31.10.2001, p. 123-134.

Research output: Contribution to journalConference article

@article{2449610fbc3f4b9c9d6d8cb51b9169b3,
title = "Analysis and design of an Adaptive Virtual Queue (AVQ) algorithm for active Queue management",
abstract = "Virtual Queue-based marking schemes have been recently for AQM (Active Queue Management) in Internet routers. We consider a particular scheme, which we call the Adaptive Virtual Queue (AVQ), and study its following properties: stability in the presence of feedback delays, its ability to maintain small queue lengths and its robustness in the presence of extremely short flows (the so-called web mice). Using a mathematical tool motivated by the earlier work of Hollot et al, we present a simple rule to design the parameters of the AVQ algorithm. We then compare its performance through simulation with several well-known AQM schemes such as RED, REM, PI controller and a non-adaptive virtual queue algorithm. With a view towards implementation, we show that AVQ can be implemented as a simple token bucket using only a few lines of code.",
author = "Srisankar Kunniyur and Rayadurgam Srikant",
year = "2001",
month = "10",
day = "31",
doi = "10.1145/964723.383069",
language = "English (US)",
volume = "31",
pages = "123--134",
journal = "Computer Communication Review",
issn = "0146-4833",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Analysis and design of an Adaptive Virtual Queue (AVQ) algorithm for active Queue management

AU - Kunniyur, Srisankar

AU - Srikant, Rayadurgam

PY - 2001/10/31

Y1 - 2001/10/31

N2 - Virtual Queue-based marking schemes have been recently for AQM (Active Queue Management) in Internet routers. We consider a particular scheme, which we call the Adaptive Virtual Queue (AVQ), and study its following properties: stability in the presence of feedback delays, its ability to maintain small queue lengths and its robustness in the presence of extremely short flows (the so-called web mice). Using a mathematical tool motivated by the earlier work of Hollot et al, we present a simple rule to design the parameters of the AVQ algorithm. We then compare its performance through simulation with several well-known AQM schemes such as RED, REM, PI controller and a non-adaptive virtual queue algorithm. With a view towards implementation, we show that AVQ can be implemented as a simple token bucket using only a few lines of code.

AB - Virtual Queue-based marking schemes have been recently for AQM (Active Queue Management) in Internet routers. We consider a particular scheme, which we call the Adaptive Virtual Queue (AVQ), and study its following properties: stability in the presence of feedback delays, its ability to maintain small queue lengths and its robustness in the presence of extremely short flows (the so-called web mice). Using a mathematical tool motivated by the earlier work of Hollot et al, we present a simple rule to design the parameters of the AVQ algorithm. We then compare its performance through simulation with several well-known AQM schemes such as RED, REM, PI controller and a non-adaptive virtual queue algorithm. With a view towards implementation, we show that AVQ can be implemented as a simple token bucket using only a few lines of code.

UR - http://www.scopus.com/inward/record.url?scp=0034776998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034776998&partnerID=8YFLogxK

U2 - 10.1145/964723.383069

DO - 10.1145/964723.383069

M3 - Conference article

AN - SCOPUS:0034776998

VL - 31

SP - 123

EP - 134

JO - Computer Communication Review

JF - Computer Communication Review

SN - 0146-4833

IS - 4

ER -