Layering as optimization decomposition: A mathematical theory of network architectures

Published

Journal Article

Network protocols in layered architectures have historically been obtained on an ad hoc basis, and many of the recent cross-layer designs are also conducted through piecemeal approaches. Network protocol stacks may instead be holistically analyzed and systematically designed as distributed solutions to some global optimization problems. This paper presents a survey of the recent efforts towards a systematic understanding of layering as optimization decomposition, where the overall communication network is modeled by a generalized network utility maximization problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems. There can be many alternative decompositions, leading to a choice of different layering architectures. This paper surveys 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 channel coding. Key messages and methods arising from many recent works are summarized, and open issues discussed. Through case studies, it is illustrated how layering as Optimization Decomposition provides a common language to think about modularization in the face of complex, networked interactions, a unifying, top-down approach to design protocol stacks, and a mathematical theory of network architectures © 2006 IEEE.

Full Text

Duke Authors

Cited Authors

  • Chiang, M; Low, SH; Calderbank, AR; Doyle, JC

Published Date

  • January 1, 2007

Published In

Volume / Issue

  • 95 / 1

Start / End Page

  • 255 - 312

International Standard Serial Number (ISSN)

  • 0018-9219

Digital Object Identifier (DOI)

  • 10.1109/JPROC.2006.887322

Citation Source

  • Scopus