The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
Abstract
Network utility maximization (NUM) problem formulations provide an important approach to conduct network resource allocation and to view layering as optimization decomposition. In the existing literature, distributed implementations are typically achieved by means of the so-called dual decomposition technique. However, the span of decomposition possibilities includes many other elements that, thus far, have not been fully exploited, such as the use of the primal decomposition technique, the versatile introduction of auxiliary variables, and the potential of multilevel decompositions. This paper presents a systematic framework to exploit alternative decomposition structures as a way to obtain different distributed algorithms, each with a different tradeoff among convergence speed, message passing amount and asymmetry, and distributed computation architecture. Several specific applications are considered to illustrate the proposed framework, including resource-constrained and direct-control rate allocation, and rate allocation among QoS classes with multipath routing. For each of these applications, the associated generalized NUM formulation is first presented, followed by the development of novel alternative decompositions and numerical experiments on the resulting new distributed algorithms. A systematic enumeration and comparison of alternative vertical decompositions in the future will help complete 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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
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
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
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
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
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
Optimization Theory of Large Systems
Lasdon, L. S., & Tabak, D. (1971) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1971.4308301 · Cited by 1,677
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-citationMinimization Methods for Non-Differentiable Functions
Shor, N. Z. (1985) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-82118-9 · Cited by 1,551
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Self-citationCongestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
The Mathematics of Internet Congestion Control
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841398 · Cited by 821
The Mathematics of Internet Congestion Control
Srikant, R. (2004) · Systems & Control: Foundations & Applications · doi:10.1007/978-0-8176-8216-3 · Cited by 800
A duality model of TCP and queue management algorithms
Low, S. H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815297 · Cited by 653
Chiang, M. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347(410 · Cited by 615
Self-citationSimultaneous Routing and Resource Allocation Via Dual Decomposition
Xiao, L., Johansson, M., & Boyd, S. P. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.831346 · Cited by 561
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Chen, L., Low, S. H., Chiang, M., & Doyle, J. C. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.142 · Cited by 532
Self-citationMaximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Stolyar, A. L. (2005) · Queueing Systems · doi:10.1007/s11134-005-1450-0 · Cited by 505
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
Eryilmaz, A., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879361 · Cited by 370
Congestion-dependent pricing of network services
Paschalidis, I. C., & Tsitsiklis, J. N. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842140 · Cited by 352
Wang, X., & Kar, K. (2005) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/1062689.1062710 · Cited by 145
Jointly optimal congestion and contention control based on network utility maximization
Lee, J.-W., Chiang, M., & Calderbank, R. (2006) · IEEE Communications Letters · doi:10.1109/lcomm.2006.1603389 · Cited by 116
Self-citationDistributed Optimization of Coupled Systems With Applications to Network Utility Maximization
Tan, C. W., Palomar, D. P., & Chiang, M. (2006) · doi:10.1109/icassp.2006.1661442 · Cited by 55
Self-citation
Cited by
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Self-citationDecomposition 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
Self-citationMIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Self-citationParallel 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
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
Metadata
- Authors
- Palomar, D. P., & Chiang, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2007-12
- Volume
- 52
- Issue
- 12
- Pages
- 2254-2269
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2038888321
- Cited by
- 294
- References
- 27
- FWCI
- 36.37
- 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.