CaltechAUTHORS
  A Caltech Library Service

Layering As Optimization Decomposition: Framework and Examples

Chiang, Mung and Low, Steven H. and Calderbank, A. Robert and Doyle, John C. (2006) Layering As Optimization Decomposition: Framework and Examples. In: 2006 IEEE Information Theory Workshop. IEEE , Piscataway, NJ, pp. 52-56. ISBN 1-4244-0035-X. https://resolver.caltech.edu/CaltechAUTHORS:20190306-130031273

[img] PDF - Published Version
See Usage Policy.

404Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190306-130031273

Abstract

Network protocols in layered architectures have historically been obtained primarily on an ad-hoc basis. Recent research has shown that network protocols may instead be holistically analyzed and systematically designed as distributed solutions to some global optimization problems in the form of Network Utility Maximization (NUM), providing insight into what they optimize and structures of the network protocol stack. This paper presents a short survey of the recent efforts towards a systematic understanding of 'layering' as 'optimization decomposition', where 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 sub-problems. Different decompositions lead to alternative layering architectures. We summarize several examples of horizontal decomposition into distributed computation and vertical decomposition into functional modules such as congestion control, routing, scheduling, random access, power control, and coding.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ITW.2006.1633780DOIArticle
ORCID:
AuthorORCID
Low, Steven H.0000-0001-6476-3048
Doyle, John C.0000-0002-1828-2486
Additional Information:© 2006 IEEE. We would like to thank all the co-authors of our publications along the direction of 'layering as optimization decomposition'.
Subject Keywords:Cross-layer design, Distributed algorithm, Lagrange duality, Network utility maximization, Optimization, Reverse engineering, TCP/IP, Wireless ad hoc networks
Record Number:CaltechAUTHORS:20190306-130031273
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190306-130031273
Official Citation:Mung Chiang, S. H. Low, A. R. Calderbank and J. C. Doyle, "Layering As Optimization Decomposition: Framework and Examples," 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este, Punta del Este, 2006, pp. 52-56. doi: 10.1109/ITW.2006.1633780
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93596
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:06 Mar 2019 22:51
Last Modified:03 Oct 2019 20:55

Repository Staff Only: item control page