Optimization flow control -- I: Basic algorithm and convergence
- Creators
-
Low, Steven L.
- Lapsley, David E.
Abstract
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment. We discuss its fairness property.
Additional Information
© Copyright 1999 IEEE. Reprinted with permission. Manuscript received December 7, 1998; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor S. Keshav. This work was supported by Melbourne IT, Melbourne, Victoria 3052, Australia. The work of S.H. Low was supported by the Australian Research Council under Grant S499705 and Grant A49930405. The work of D.I.E. Lapsley was supported by the Australian Commonwealth Government and ATERB under scholarships. The authors are grateful to F. Kelly, D. Mitra, J. Tsitsiklis, and A. Weiss for very helpful discussions. The first author would also like to thank B. Doshi and Y.T. Wang of Bell Laboratories, Lucent Technologies, for their hospitality during a visit in 1997 where part of this work was done.Files
| Name | Size | Download all |
|---|---|---|
|
md5:c008df24b00d0ee7a7798f433f0be216
|
360.2 kB | Preview Download |
Additional details
- Eprint ID
- 8579
- Resolver ID
- CaltechAUTHORS:LOWieeeacmtn99
- Created
-
2007-08-21Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field