DMCA
Optimization Flow Control, I: Basic Algorithm and Convergence (1999)
Cached
Download Links
| Venue: | IEEE/ACM TRANSACTIONS ON NETWORKING |
| Citations: | 694 - 64 self |
BibTeX
@ARTICLE{Low99optimizationflow,
author = {Steven H. Low and David E. Lapsley},
title = {Optimization Flow Control, I: Basic Algorithm and Convergence},
journal = {IEEE/ACM TRANSACTIONS ON NETWORKING},
year = {1999},
volume = {7},
number = {6},
pages = {861--874}
}
Share
 |
 |
 |
 |
||
OpenURL
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 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.
Keyphrases
basic algorithm optimization flow control network link utility minus bandwidth cost transmission rate computation system dual problem optimization approach bandwidth price present measurement time-varying environment different time gradient projection algorithm preliminary prototype static environment aggregate source utility different frequency system source select transmission rate
