A distributed globally convergent algorithm for fair, queue-length-based congestion control

Research output: Contribution to journalConference article

Abstract

We present an easy-to-implement explicit rate congestion control algorithm for connection-oriented data networks. The algorithm is adaptive to changing network conditions, robust to network delays, and is decentralized. Further, it achieves max-min fairness and queue length stability under finite buffer length and minimum rate constraints. The proof of global convergence of the algorithm involves stability analysis of discrete-time linear systems with saturation.

Original languageEnglish (US)
Pages (from-to)622-627
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume1
StatePublished - Dec 1 2001
Event40th IEEE Conference on Decision and Control (CDC) - Orlando, FL, United States
Duration: Dec 4 2001Dec 7 2001

Fingerprint

Congestion Control
Queue Length
Adaptive algorithms
Max-min Fairness
Linear systems
Finite Buffer
Discrete-time Linear Systems
Algorithm Analysis
Rate Control
Global Convergence
Decentralized
Control Algorithm
Saturation
Stability Analysis

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

@article{0adc078fbf5d4893a09a94579ad762ec,
title = "A distributed globally convergent algorithm for fair, queue-length-based congestion control",
abstract = "We present an easy-to-implement explicit rate congestion control algorithm for connection-oriented data networks. The algorithm is adaptive to changing network conditions, robust to network delays, and is decentralized. Further, it achieves max-min fairness and queue length stability under finite buffer length and minimum rate constraints. The proof of global convergence of the algorithm involves stability analysis of discrete-time linear systems with saturation.",
author = "Imer, {Orhan {\cC}} and Basar, {M Tamer} and Rayadurgam Srikant",
year = "2001",
month = "12",
day = "1",
language = "English (US)",
volume = "1",
pages = "622--627",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A distributed globally convergent algorithm for fair, queue-length-based congestion control

AU - Imer, Orhan Ç

AU - Basar, M Tamer

AU - Srikant, Rayadurgam

PY - 2001/12/1

Y1 - 2001/12/1

N2 - We present an easy-to-implement explicit rate congestion control algorithm for connection-oriented data networks. The algorithm is adaptive to changing network conditions, robust to network delays, and is decentralized. Further, it achieves max-min fairness and queue length stability under finite buffer length and minimum rate constraints. The proof of global convergence of the algorithm involves stability analysis of discrete-time linear systems with saturation.

AB - We present an easy-to-implement explicit rate congestion control algorithm for connection-oriented data networks. The algorithm is adaptive to changing network conditions, robust to network delays, and is decentralized. Further, it achieves max-min fairness and queue length stability under finite buffer length and minimum rate constraints. The proof of global convergence of the algorithm involves stability analysis of discrete-time linear systems with saturation.

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

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

M3 - Conference article

AN - SCOPUS:0035711611

VL - 1

SP - 622

EP - 627

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -