Math @ Duke

Publications [#235858] of Robert Calderbank
Papers Published
 Chiang, M; Low, SH; Calderbank, AR; Doyle, JC, Layering as optimization decomposition: Framework and examples,
2006 IEEE Information Theory Workshop, ITW 2006
(2006),
pp. 5256
(last updated on 2018/12/19)
Abstract: Network protocols in layered architectures have historically been obtained primarily on an adhoc 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. © 2006 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

