Abstract
This paper studies the mathematical modelling of Internet congestion control. Differently to previous models, which consider either the link capacity or the node processing capability as the constraints, here we take both of them into account, i.e., the aggregate flow rate on a link cannot exceed the link capacity and the aggregate flow rate at a node is limited by the node processing capability. A decentralized primal-dual algorithm is proposed to solve the congestion control problem and its convergence is proven. Using this algorithm we show the bottleneck of the network performance when these two constraints are unbalanced.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 17th World Congress, International Federation of Automatic Control, IFAC |
| Publisher | Elsevier - International Federation of Automatic Control (IFAC) |
| Edition | 1 PART 1 |
| ISBN (Print) | 9783902661005 |
| DOIs | |
| Publication status | Published - 2008 |
| Externally published | Yes |
| Event | International Federation of Automatic Control World Congress 2008 - Convention and Exhibition Center, Seoul, Korea, South Duration: 6 Jul 2008 → 11 Jul 2008 Conference number: 17th https://web.archive.org/web/20080609024600/http://www.ifac2008.org/ |
Publication series
| Name | IFAC Proceedings Volumes (IFAC-PapersOnline) |
|---|---|
| Number | 1 PART 1 |
| Volume | 17 |
| ISSN (Print) | 1474-6670 |
Conference
| Conference | International Federation of Automatic Control World Congress 2008 |
|---|---|
| Abbreviated title | IFAC 2008 |
| Country/Territory | Korea, South |
| City | Seoul |
| Period | 6/07/08 → 11/07/08 |
| Internet address |
Keywords
- The internet
- Traffic control