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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'A distributed globally convergent algorithm for fair, queue-length-based congestion control'. Together they form a unique fingerprint.

  • Cite this