By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nair, J. ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA ; Manjunath, D.

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.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:17 ,  Issue: 4 )