Distributed Iterative Optimal Resource Allocation With Concurrent Updates of Routing and Flow Control Variables
- 26 May 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 17 (4) , 1312-1325
- https://doi.org/10.1109/tnet.2008.2008419
Abstract
Consider a set of active elastic sessions over a network. Session traffic is routed at each hop (potentially through multiple network paths) based only on its destination. Each session is associated with a concave increasing utility function of its transfer rate. The transfer rates of all sessions and the routing policy define the operating point of the network. We construct a metric f of the goodness of this operating point. f is an increasing function of the session utilities and a decreasing function of the extent of congestion in the network. We define ldquogoodrdquo operating points as those that maximize f, subject to the capacity constraints in the network. This paper presents a distributed, iterative algorithm for adapting the session rates and the routing policy across the network so as to converge asymptotically to the set of ldquogoodrdquo operating points. The algorithm updates session rates and routing variables concurrently and is, therefore, amenable to distributed online implementation. The convergence of the concurrent update scheme is proved rigorously.Keywords
This publication has 17 references indexed in Scilit:
- Utility Maximization for Communication Networks With Multipath RoutingIEEE Transactions on Automatic Control, 2006
- Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual AlgorithmQueueing Systems, 2005
- Cross-layer rate control for end-to-end proportional fairness in wireless networks with random accessPublished by Association for Computing Machinery (ACM) ,2005
- Dynamic Cesaro-Wardrop equilibration in networksIEEE Transactions on Automatic Control, 2003
- A game theoretic framework for bandwidth allocation and pricing in broadband networksIEEE/ACM Transactions on Networking, 2000
- Optimization flow control. I. Basic algorithm and convergenceIEEE/ACM Transactions on Networking, 1999
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998
- Stochastic approximation with two time scalesSystems & Control Letters, 1997
- Dynamical systems and variational inequalitiesAnnals of Operations Research, 1993
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977