TY - GEN
T1 - Layering as optimization decomposition
T2 - 2006 IEEE Information Theory Workshop, ITW 2006
AU - Chiang, Mung
AU - Low, Steven H.
AU - Calderbank, A. Robert
AU - Doyle, John C.
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Cross-layer design
KW - Distributed algorithm
KW - Lagrange duality
KW - Network utility maximization
KW - Optimization
KW - Reverse engineering
KW - TCP/IP
KW - Wireless ad hoc networks
UR - http://www.scopus.com/inward/record.url?scp=33751046660&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33751046660&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33751046660
SN - 142440035X
SN - 9781424400355
T3 - 2006 IEEE Information Theory Workshop, ITW 2006
SP - 52
EP - 56
BT - 2006 IEEE Information Theory Workshop, ITW 2006
Y2 - 13 March 2006 through 17 March 2006
ER -