Optimization flow control. I. Basic algorithm and convergence

• Published in: IEEE/ACM transactions on networking Vol. 7; no. 6; pp. 861 - 874
• Main Authors: Low, S.H., Lapsley, D.E.
• Format: Journal Article
• Language: English
• Published: IEEE 01.12.1999
• Subjects: Aggregates; Algorithms; Bandwidth; Computer networks; Convergence; Costs; Delay effects; Distributed computing; Feedback; Flow control; Frequency; Links; Networks; Optimization; Projection algorithms; Utilities
• ISSN: 1063-6692
• DOI: 10.1109/90.811451

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.