Abstract
In this paper, we study the problem of designing globally stable, scalable congestion control algorithms for the Internet. Prior work has primarily used linear stability as the criterion for such a design. Global stability has been studied only for single node, single source problems. Here, we obtain conditions for a general topology network accessed by sources with heterogeneous delays. We obtain a sufficient condition for global stability in terms of the increase/decrease parameters of the congestion control algorithm and the price functions used at the links.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the American Control Conference |
| Pages | 2948-2953 |
| Number of pages | 6 |
| Volume | 4 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States Duration: Jun 30 2004 → Jul 2 2004 |
Other
| Other | Proceedings of the 2004 American Control Conference (AAC) |
|---|---|
| Country/Territory | United States |
| City | Boston, MA |
| Period | 6/30/04 → 7/2/04 |
ASJC Scopus subject areas
- Control and Systems Engineering