Abstract
This paper investigates convergence properties of basic REM flow control algorithm via Lyapunov functions. The decentralized algorithm REM consists of a link algorithm that updates a congestion measure, also called "price", based on the excess capacity and backlog at that link, and a source algorithm that adapts the source rate to congestion in its path. At the equilibrium of the algorithm, links are fully utilized, and all buffers are cleared. Convergence of the algorithm is established for single and two-link cases using a Lyapunov argument. Extension to the general multi-link model is discussed as well.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2943-2947 |
| Number of pages | 5 |
| Journal | Proceedings of the American Control Conference |
| Volume | 4 |
| DOIs | |
| State | Published - 2004 |
| Event | Proceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States Duration: Jun 30 2004 → Jul 2 2004 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering