The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Simultaneous Routing and Resource Allocation Via Dual Decomposition
Abstract
In wireless data networks, the optimal routing of data depends on the link capacities which, in turn, are determined by the allocation of communications resources (such as transmit powers and bandwidths) to the links. The optimal performance of the network can only be achieved by simultaneous optimization of routing and resource allocation. In this paper, we formulate the simultaneous routing and resource allocation (SRRA) problem, and exploit problem structure to derive efficient solution methods. We use a capacitated multicommodity flow model to describe the data flows in the network. We assume that the capacity of a wireless link is a concave and increasing function of the communications resources allocated to the link, and the communications resources for groups of links are limited. These assumptions allow us to formulate the SRRA problem as a convex optimization problem over the network flow variables and the communications variables. These two sets of variables are coupled only through the link capacity constraints. We exploit this separable structure by dual decomposition. The resulting solution method attains the optimal coordination of data routing in the network layer and resource allocation in the radio control layer via pricing on the link capacities.
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
Self-citationElements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
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
Minimization 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
A comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650137 · Cited by 1,395
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Rockafellar, R. T. (1976) · Mathematics of Operations Research · doi:10.1287/moor.1.2.97 · Cited by 1,175
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
Xie, L.-L., & Kumar, P. R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.826631 · Cited by 723
A Minimum Delay Routing Algorithm Using Distributed Computation
Gallager, R. (1977) · IEEE Transactions on Communications · doi:10.1109/tcom.1977.1093711 · Cited by 651
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
Li, L., & Goldsmith, A. J. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915665 · Cited by 518
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.2307/3010473 · Cited by 401
Cross-layer optimization of wireless networks using nonlinear column generation
Johansson, M., & Xiao, L. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1611067 · Cited by 191
Self-citationA Survey of Algorithms for Convex Multicommodity Flow Problems
Ouorou, A., Mahey, P., & Vial, J.-P. (2000) · Management Science · doi:10.1287/mnsc.46.1.126.15132 · Cited by 162
Cited by
Stochastic 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
Dual methods for nonconvex spectrum optimization of multicarrier systems
Yu, W., & Lui, R. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2006.877962 · Cited by 1,572
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
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
Zhang, R., & Liang, Y.-C. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.914894 · Cited by 834
A tutorial on cross-layer optimization in wireless networks
Lin, X., Shroff, N. B., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879351 · Cited by 833
Metadata
- Authors
- Xiao, L., Johansson, M., & Boyd, S. P.
- Venue
- IEEE Transactions on Communications
- Published
- 2004-07
- Volume
- 52
- Issue
- 7
- Pages
- 1136-1144
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W1572270094
- Cited by
- 561
- References
- 14
- FWCI
- 46.43
- 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.