Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Princeton University · California Institute of Technology · +1 more institution
Abstract
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…
Citation impact
- FWCI
- 126.60
- Percentile
- 100%
- References
- 190
Authors
4Topics & keywords
- Computer science
- Distributed computing
- Decomposition
- Optimization problem
- Scheduling (production processes)
- Theoretical computer science
- Mathematical optimization
- Algorithm