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 language | English (US) |
|---|---|
| Pages (from-to) | 622-627 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 1 |
| State | Published - 2001 |
| Event | 40th IEEE Conference on Decision and Control (CDC) - Orlando, FL, United States Duration: Dec 4 2001 → Dec 7 2001 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization