Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the IEEE Ročník 95; číslo 1; s. 255 - 312
Hlavní autoři: Chiang, Mung, Low, Steven H., Calderbank, A. Robert, Doyle, John C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.01.2007
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Ad hoc network
Architecture
channel coding
Communication networks
Communications networks
Computer architecture
computer network
congestion control
Cross layer design
Decomposition
Design
Design optimization
distributed algorithm
Distributed computing
feedback control
game theory
Internet
Lagrange duality
Layering
Mathematical analysis
Mathematical models
medium access control (MAC)
network utility maximization (NUM)
Networks
Optimization
Power control
Processor scheduling
Protocol (computers)
Protocols
r everse-engineering
Routing
scheduling
stochastic networks
Studies
transmission control protocol (TCP)/Internet protocol (IP)
Utility programs
wireless communications
ISSN:0018-9219, 1558-2256
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0018-9219
1558-2256
DOI:10.1109/JPROC.2006.887322