Math @ Duke

Publications [#235873] of Robert Calderbank
Papers Published
 Chiang, M; Low, SH; Calderbank, AR; Doyle, JC, Layering as optimization decomposition: Current status and open issues,
2006 IEEE Conference on Information Sciences and Systems, CISS 2006  Proceedings
(2007),
pp. 355362 [doi]
(last updated on 2018/08/14)
Abstract: Network protocols in layered architectures have historically been obtained on an adhoc basis, and much of the recent crosslayer designs are conducted through piecemeal approaches. Network protocols may instead be holistically analyzed and systematically designed as distributed solutions to some global optimization problems in the form of generalized Network Utility Maximization (NUM), providing insight on 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. Furthermore, there are many alternative decompositions, each leading to a different layering architecture. Industry adoption of this unifying framework has also started. Here we summarize 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 coding. Key messages and methodologies arising out of many recent work are listed. Then we present a list of challenging open issues in this area and the initial progress made on some of them. © 2006 IEEE.


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

