The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Abstract
Network protocols in layered architectures have historically been obtained on anad hocbasis, 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Tassiulas, L., & Ephremides, A. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.182479 · Cited by 2,834
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Self-citation
Cited by
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Controllability of complex networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2011) · Nature · doi:10.1038/nature10011 · Cited by 3,215
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Fog and IoT: An Overview of Research Opportunities
Chiang, M., & Zhang, T. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2584538 · Cited by 2,362
Self-citationStochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
A tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647
Self-citationControl and Communication Challenges in Networked Real-Time Systems
Baillieul, J., & Antsaklis, P. J. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887290 · Cited by 924
Robust Energy Management for Microgrids With High-Penetration Renewables
Zhang, Y., Gatsis, N., & Giannakis, G. B. (2013) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2013.2255135 · Cited by 798
Exact controllability of complex networks
Yuan, Z., Zhao, C., Di, Z., Wang, W.-X., & Lai, Y.-C. (2013) · Nature Communications · doi:10.1038/ncomms3447 · Cited by 565
Subgradient Methods for Saddle-Point Problems
Nedić, A., & Ozdaglar, A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9522-7 · Cited by 438
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
Nedić, A., & Ozdaglar, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070708111 · Cited by 399
A control perspective for centralized and distributed convex optimization
Wang, J., & Elia, N. (2011) · IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6161503 · Cited by 398
Guo, S., Liu, J., Yang, Y., Xiao, B., & Li, Z. (2019) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2018.2831230 · Cited by 354
Distributed Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351
Stability of primal–dual gradient dynamics and applications to network optimization
Feijer, D., & Paganini, F. (2010) · Automatica · doi:10.1016/j.automatica.2010.08.011 · Cited by 349
Optimal Resource Allocation in Coordinated Multi-Cell Systems
Björnson, E., & Jorswieck, E. (2013) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000069 · Cited by 349
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Scutari, G., Facchinei, F., Song, P., Palomar, D. P., & Pang, J.-S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2293126 · Cited by 338
Volatility of power grids under real-time pricing
Roozbehani, M., Dahleh, M. A., & Mitter, S. K. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2195037 · Cited by 335
Network Optimization and Control
Shakkottai, S., & Srikant, R. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000007 · Cited by 320
Subgradient methods and consensus algorithms for solving convex optimization problems
Johansson, B., Keviczky, T., Johansson, M., & Johansson, K. H. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4739339 · Cited by 316
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Scutari, G., Facchinei, F., & Lampariello, L. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2637317 · Cited by 314
Coding Techniques for Repairability in Networked Distributed Storage Systems
Oggier, F., & Datta, A. (2013) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000068 · Cited by 305
Zhou, Z., Zhou, S., Cui, J.-H., & Cui, S. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.061097 · Cited by 304
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
Palomar, D. P., & Chiang, M. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.910665 · Cited by 294
Self-citationDistributed Optimization Based on a Multiagent System in the Presence of Communication Delays
Yang, S., Liu, Q., & Wang, J. (2017) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2016.2531649 · Cited by 289
Twelve Scientific Challenges for 6G: Rethinking the Foundations of Communications Theory
Chafii, M., Bariah, L., Muhaidat, S., & Debbah, M. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3243918 · Cited by 289
Event-Triggered Feedback in Control, Estimation, and Optimization
Lemmon, M. (2010) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-0-85729-033-5_9 · Cited by 288
Reliable Physical Layer Network Coding
Nazer, B., & Gastpar, M. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2094170 · Cited by 276
Joint Mobile Data Gathering and Energy Provisioning in Wireless Rechargeable Sensor Networks
Guo, S., Wang, C., & Yang, Y. (2014) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2014.2307332 · Cited by 263
Biological underpinnings for lifelong learning machines
Kudithipudi, D., Aguilar-Simon, M., Babb, J., Bazhenov, M., Blackiston, D., Bongard, J., Brna, A. P., Chakravarthi Raja, S., Cheney, N., Clune, J., et al. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00452-0 · Cited by 236
Large-scale convex optimization for ultra-dense cloud-RAN
Shi, Y., Zhang, J., Letaief, K. B., Bai, B., & Chen, W. (2015) · IEEE Wireless Communications · doi:10.1109/mwc.2015.7143330 · Cited by 108
Hughes, L., Wang, X., & Chen, T. (2012) · Sensors · doi:10.3390/s121114730 · Cited by 71
A quantitative framework for layered multirate control: Toward a theory of control architecture
Matni, N., Ames, A. D., & Doyle, J. C. (2024) · IEEE Control Systems · doi:10.1109/mcs.2024.3382388 · Cited by 39
Self-citationIutzeler, F., Bianchi, P., Ciblat, P., & Hachem, W. (2014) · 53rd IEEE Conference on Decision and Control · doi:10.1109/cdc.2014.7040177 · Cited by 10
Metadata
- Authors
- Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C.
- Venue
- Proceedings of the IEEE
- Published
- 2007-01
- Volume
- 95
- Issue
- 1
- Pages
- 255-312
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2158893758
- Cited by
- 1,352
- References
- 72
- FWCI
- 116.55
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.