Congestion control algorithms from optimal control perspective
- Creators
- Lavaei, Javad
- Doyle, John C.
- Low, Steven H.
Abstract
This paper is concerned with understanding the connection between the existing Internet congestion control algorithms and the optimal control theory. The available resource allocation controllers are mainly devised to derive the state of the system to a desired equilibrium point and, therefore, they are oblivious to the transient behavior of the closed-loop system. This work aims to investigate what dynamical functions the existing algorithms maximize (minimize). In particular, it is shown that there exist meaningful cost functionals whose minimization leads to the celebrated primal and dual congestion algorithms. An implication of this result is that a real network problem may be solved by regarding it as an optimal control problem on which some practical constraints, such as a real-time link capacity constraint, are imposed.
Additional Information
© 2009 IEEE. This research was supported by ONR MURI N00014-08-1-0747 "Scalable, Data-driven, and Provably-correct Analysis of Networks," ARO MURI W911NF-08-1-0233 "Tools for the Analysis and Design of Complex Multi-Scale Networks," and the Army's W911NF-09-D-0001 Institute for Collaborative Biotechnology.Attached Files
Published - 05399554.pdf
Files
Name | Size | Download all |
---|---|---|
md5:34fd427192bd6a0ff5d91c7288aa6f68
|
470.8 kB | Preview Download |
Additional details
- Eprint ID
- 80210
- Resolver ID
- CaltechAUTHORS:20170810-133936531
- N00014-08-1-0747
- Office of Naval Research (ONR)
- W911NF-08-1-0233
- Army Research Office (ARO)
- W911NF-09-D-0001
- Army Research Office (ARO)
- Created
-
2017-08-11Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field