Distributed iterative optimal resource allocation with concurrent updates of routing and flow control variables

Authors:
Jayakrishnan Nair;D. Manjunath
Affiliations:
Department of Electrical Engineering, California Institute of Technology, Pasadena, CA;Department of Electrical Engineering and the Bharti Centre for Communication, Indian Institute of Technology, Bombay, Mumbai, India
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 11
Cited 0

Data networks

Data networks
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Stochastic approximation with two time scales

Systems & Control Letters
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks

IEEE/ACM Transactions on Networking (TON)
Multipath Optimization Flow Control

ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1)

Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1)
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization

IEEE Transactions on Information Theory
Joint congestion control, routing, and MAC for stability and fairness in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 maximizef, 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.