We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Optimization flow control. I. Basic algorithm and convergence
PeriodicalsComputer Science & Information Technology

Optimization flow control. I. Basic algorithm and convergence

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Steven H. Low, D.E. Lapsely (1999). Optimization flow control. I. Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6), 861–874. https://doi.org/10.1109/90.811451

Copy in another style

Low, S. H., & Lapsely, D. (1999). Optimization flow control. I. Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6), 861–874. https://doi.org/10.1109/90.811451
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.