Layering as optimization decomposition: Framework and examples

Mung Chiang, Steven H. Low, A. Robert Calderbank, John C. Doyle

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations


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 subproblems. 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.

Original languageAmerican English
Title of host publication2006 IEEE Information Theory Workshop, ITW 2006
Number of pages5
StatePublished - 2006
Event2006 IEEE Information Theory Workshop, ITW 2006 - Punta del Este, Uruguay
Duration: Mar 13 2006Mar 17 2006

Publication series

Name2006 IEEE Information Theory Workshop, ITW 2006


Other2006 IEEE Information Theory Workshop, ITW 2006
CityPunta del Este

ASJC Scopus subject areas

  • General Engineering


  • Cross-layer design
  • Distributed algorithm
  • Lagrange duality
  • Network utility maximization
  • Optimization
  • Reverse engineering
  • TCP/IP
  • Wireless ad hoc networks

Cite this