A Caltech Library Service

Layering as Optimization Decomposition: Questions and Answers

Chiang, Mung and Low, Steven H. and Calderbank, A. Robert and Doyle, John C. (2006) Layering as Optimization Decomposition: Questions and Answers. In: MILCOM 2006. IEEE , Piscataway, NJ. ISBN 1-4244-0617-X.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


Network protocols in layered architectures have historically been obtained on an ad-hoc basis, and much of the recent cross-layer designs are conducted through piecemeal approaches. Network protocols may instead be holistically analyzed and systematically designed as distributed solutions to some global optimization problems in the form of generalized Network Utility Maximization (NUM), providing insight on what they optimize and on the structures of network protocol stacks. In the form of 10 Questions and Answers, this paper presents a short survey of the recent efforts towards a systematic understanding of "layering" as "optimization decomposition". The overall communication network is modeled by a generalized NUM problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems. Furthermore, there are many alternative decompositions, each leading to a different layering architecture. Industry adoption of this unifying framework has also started. Here we summarize the current status of horizontal decomposition into distributed computation and vertical decomposition into functional modules such as congestion control, routing, scheduling, random access, power control, and coding. We also discuss under-explored future research directions in this area. More importantly than proposing any particular crosslayer design, this framework is working towards a mathematical foundation of network architectures and the design process of modularization.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Low, Steven H.0000-0001-6476-3048
Doyle, John C.0000-0002-1828-2486
Additional Information:© 2006 IEEE. The work summarized in this paper has been in part supported by NSF grants CCF-0440043, CCF-0448012, CNS-0417607, CNS-0427677, CNS-0430487, CNS-0519880, DARPA grant HR0011-06-1-0008, AFOSR FA9550-06-1-0297, and Cisco grant GH072605.
Funding AgencyGrant Number
Defense Advanced Research Projects Agency (DARPA)HR0011-06-1-0008
Air Force Office of Scientific Research (AFOSR)FA9550-06-1-0297
Subject Keywords:Adaptive coding, Cross-layer design, Congestion control, Distributed algorithm, Lagrange duality, MAC, Network architecture, Network utility maximization, Optimization, Power control, Reverse engineering, Routing, TCP/IP, Scheduling, Stochastic control, Wireless ad hoc networks
Record Number:CaltechAUTHORS:20170508-172152981
Persistent URL:
Official Citation:M. Chiang, S. H. Low, A. R. Calderbank and J. C. Doyle, "Layering as Optimization Decomposition: Questions and Answers," MILCOM 2006 - 2006 IEEE Military Communications conference, Washington, DC, 2006, pp. 1-10. doi: 10.1109/MILCOM.2006.302293
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:77276
Deposited By: Kristin Buxton
Deposited On:16 May 2017 20:16
Last Modified:09 Mar 2020 13:19

Repository Staff Only: item control page