.png){kind=icon}
.png){kind=icon}
Return
A tutorial on decomposition methods for network utility maximization
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2006.879350.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the most appropriate distributed algorithm for a given network resource allocation problem, and quantifies the comparison across architectural alternatives of modularized network design. Decomposition theory naturally provides the mathematical language to build an analytic foundation for the design of modularized and distributed control of networks. In this tutorial paper, we first review the basics of convexity, Lagrange duality, distributed subgradient method, Jacobi and Gauss-Seidel iterations, and implication of different time scales of variable updates. Then, we introduce primal, dual, indirect, partial, and hierarchical decompositions, focusing on network utility maximization problem formulations and the meanings of primal and dual decompositions in terms of network architectures. Finally, we present recent examples on: systematic search for alternative decompositions; decoupling techniques for coupled objective functions; and decoupling techniques for coupled constraint sets that are not readily decomposable.
Keywords:
congestion control
cross-layer design
decomposition
distributed algorithm
network architecture
network control by pricing
network utility maximization
optimization
power control
resource allocation
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W