Rate-based versus queue-based models of congestion control

Supratim Deb, R. Srikant

Research output: Contribution to journalConference article

Abstract

Mathematical models of congestion control capture the congestion indication mechanism at the router in two different ways: rate-based models, where the queue-length at the router does not explicitly appear in the model, and queue-based models, where the queue length at the router is explicitly a part of the model. Even though most congestion indication mechanisms use the queue length to compute the packet marking or dropping probability to indicate congestion, we argue that, depending upon the choice of the parameters of the AQM scheme, one would obtain a rate-based model or a rate-and-queue-based model as the deterministic limit of a stochastic system with a large number of users. We also consider the impact of implementing AQM schemes in the real queue or a virtual queue. If an AQM scheme is implemented in a real queue, we show that, to ensure that the queuing delays are negligible compared to RTTs, one is forced to choose the parameters of a AQM scheme in a manner which yields a rate-based deterministic model. On the other hand, if the AQM scheme is implemented in a virtual queue, small-queue operation is achieved independent of the choice of the parameters, thus showing a robustness property of virtual queue-based schemes.

Original languageEnglish (US)
Pages (from-to)246-257
Number of pages12
JournalPerformance Evaluation Review
Volume32
Issue number1
DOIs
StatePublished - Jan 1 2004
EventSIGMETRICS 2004/Performance 2004: Joint International Conference on Measurement and Modeling of Computer Systems - New York, NY, United States
Duration: Jun 12 2004Jun 16 2004

Fingerprint

Routers
Stochastic systems
Mathematical models

Keywords

  • AQM parameters
  • Congestion Control
  • Virtual Queue

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Rate-based versus queue-based models of congestion control. / Deb, Supratim; Srikant, R.

In: Performance Evaluation Review, Vol. 32, No. 1, 01.01.2004, p. 246-257.

Research output: Contribution to journalConference article

@article{60846c6ee1034ccbbb0288534549feed,
title = "Rate-based versus queue-based models of congestion control",
abstract = "Mathematical models of congestion control capture the congestion indication mechanism at the router in two different ways: rate-based models, where the queue-length at the router does not explicitly appear in the model, and queue-based models, where the queue length at the router is explicitly a part of the model. Even though most congestion indication mechanisms use the queue length to compute the packet marking or dropping probability to indicate congestion, we argue that, depending upon the choice of the parameters of the AQM scheme, one would obtain a rate-based model or a rate-and-queue-based model as the deterministic limit of a stochastic system with a large number of users. We also consider the impact of implementing AQM schemes in the real queue or a virtual queue. If an AQM scheme is implemented in a real queue, we show that, to ensure that the queuing delays are negligible compared to RTTs, one is forced to choose the parameters of a AQM scheme in a manner which yields a rate-based deterministic model. On the other hand, if the AQM scheme is implemented in a virtual queue, small-queue operation is achieved independent of the choice of the parameters, thus showing a robustness property of virtual queue-based schemes.",
keywords = "AQM parameters, Congestion Control, Virtual Queue",
author = "Supratim Deb and R. Srikant",
year = "2004",
month = "1",
day = "1",
doi = "10.1145/1012888.1005717",
language = "English (US)",
volume = "32",
pages = "246--257",
journal = "Performance Evaluation Review",
issn = "0163-5999",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - Rate-based versus queue-based models of congestion control

AU - Deb, Supratim

AU - Srikant, R.

PY - 2004/1/1

Y1 - 2004/1/1

N2 - Mathematical models of congestion control capture the congestion indication mechanism at the router in two different ways: rate-based models, where the queue-length at the router does not explicitly appear in the model, and queue-based models, where the queue length at the router is explicitly a part of the model. Even though most congestion indication mechanisms use the queue length to compute the packet marking or dropping probability to indicate congestion, we argue that, depending upon the choice of the parameters of the AQM scheme, one would obtain a rate-based model or a rate-and-queue-based model as the deterministic limit of a stochastic system with a large number of users. We also consider the impact of implementing AQM schemes in the real queue or a virtual queue. If an AQM scheme is implemented in a real queue, we show that, to ensure that the queuing delays are negligible compared to RTTs, one is forced to choose the parameters of a AQM scheme in a manner which yields a rate-based deterministic model. On the other hand, if the AQM scheme is implemented in a virtual queue, small-queue operation is achieved independent of the choice of the parameters, thus showing a robustness property of virtual queue-based schemes.

AB - Mathematical models of congestion control capture the congestion indication mechanism at the router in two different ways: rate-based models, where the queue-length at the router does not explicitly appear in the model, and queue-based models, where the queue length at the router is explicitly a part of the model. Even though most congestion indication mechanisms use the queue length to compute the packet marking or dropping probability to indicate congestion, we argue that, depending upon the choice of the parameters of the AQM scheme, one would obtain a rate-based model or a rate-and-queue-based model as the deterministic limit of a stochastic system with a large number of users. We also consider the impact of implementing AQM schemes in the real queue or a virtual queue. If an AQM scheme is implemented in a real queue, we show that, to ensure that the queuing delays are negligible compared to RTTs, one is forced to choose the parameters of a AQM scheme in a manner which yields a rate-based deterministic model. On the other hand, if the AQM scheme is implemented in a virtual queue, small-queue operation is achieved independent of the choice of the parameters, thus showing a robustness property of virtual queue-based schemes.

KW - AQM parameters

KW - Congestion Control

KW - Virtual Queue

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

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

U2 - 10.1145/1012888.1005717

DO - 10.1145/1012888.1005717

M3 - Conference article

AN - SCOPUS:8344271383

VL - 32

SP - 246

EP - 257

JO - Performance Evaluation Review

JF - Performance Evaluation Review

SN - 0163-5999

IS - 1

ER -