Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2009 | public
Journal Article

Distributed Iterative Optimal Resource Allocation With Concurrent Updates of Routing and Flow Control Variables

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 "good" 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 "good" 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.

Additional Information

© Copyright 2009 IEEE. Manuscript received October 23, 2007; revised May 13, 2008 and August 12, 2008; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor R. Mazumdar. First published May 26, 2009; current version published August 19, 2009. This work was supported in part by a grant from the Ministry of Information and Communication Technology of the Government of India. The authors are grateful to G. Srinivasan and V. Borkar for many helpful discussions.

Additional details

Created:
August 21, 2023
Modified:
October 19, 2023