Abstract
In this paper we address the congestion control problem in computer networks offering a single class of best effort service. The problem is viewed as a resource allocation problem. The objective is to distribute the available network resources among competitive users in a fair way. The fairness criterion adopted is the max-min criterion. The problem is formulated mathematically and a decentralized, simple to implement algorithm is considered. The resulting feedback system can be realized as an autonomous switched system. The special structure of the system and the fundamental properties resulting from this structure are outlined. Global asymptotic stability is then established for two 2-dimensional network examples. The extension of this stability result to higher dimension networks is currently under investigation.
Original language | English |
---|---|
Article number | TuB03.3 |
Pages (from-to) | 543-548 |
Number of pages | 6 |
Journal | Proceedings of the IEEE Conference on Decision and Control |
Volume | 1 |
DOIs | |
Publication status | Published - 2004 |
Externally published | Yes |
Event | 2004 43rd IEEE Conference on Decision and Control (CDC) - Nassau, Bahamas Duration: 14 Dec 2004 → 17 Dec 2004 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization