Simultaneous routing and resource allocation via dual decomposition

Lin Xiao, Mikael Johansson, Stephen P. Boyd

Research output: Contribution to journalArticlepeer-review

453 Scopus citations


In wireless data networks, the optimal routing of data depends on the link capacities which, in turn, are determined by the allocation of communications resources (such as transmit powers and bandwidths) to the links. The optimal performance of the network can only be achieved by simultaneous optimization of routing and resource allocation. In this paper, we formulate the simultaneous routing and resource allocation (SRRA) problem, and exploit problem structure to derive efficient solution methods. We use a capacitated multicommodity flow model to describe the data flows in the network. We assume that the capacity of a wireless link is a concave and increasing function of the communications resources allocated to the link, and the communications resources for groups of links are limited. These assumptions allow us to formulate the SRRA problem as a convex optimization problem over the network flow variables and the communications variables. These two sets of variables are coupled only through the link capacity constraints. We exploit this separable structure by dual decomposition. The resulting solution method attains the optimal coordination of data routing in the network layer and resource allocation in the radio control layer via pricing on the link capacities.

Original languageEnglish
Pages (from-to)1136-1144
Number of pages9
JournalIEEE Transactions on Communications
Issue number7
StatePublished - Jul 2004
Externally publishedYes


Dive into the research topics of 'Simultaneous routing and resource allocation via dual decomposition'. Together they form a unique fingerprint.

Cite this