The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
Abstract
In this paper, we describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks, that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue-lengths serve as common information to different layers of the network protocol stack. Our main contribution is to prove the asymptotic optimality of a primal-dual congestion controller, which is known to model different versions of transmission control protocol well
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
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
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
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
Self-citationCross-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
Maximizing 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
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
Chaporkar, P., Kar, K., Luo, X., & Sarkar, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913537 · Cited by 253
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
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
Self-citationFair Resource Allocation in Federated Learning
Li, T., Sanjabi, M., Beirami, A., & Smith, V. (2019) · arXiv · doi:10.48550/arxiv.1905.10497 · Cited by 475
Fairness in wireless networks: Issues, measures and challenges
Shi, H., Prasad, R. V., Onur, E., & Niemegeers, I. G. M. M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00015 · Cited by 446
Network Optimization and Control
Shakkottai, S., & Srikant, R. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000007 · Cited by 320
Self-citationA˚ström, K. J., & Kumar, P. R. (2014) · Automatica · doi:10.1016/j.automatica.2013.10.012 · Cited by 304
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
Metadata
- Authors
- Eryilmaz, A., & Srikant, R.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2006-08
- Volume
- 24
- Issue
- 8
- Pages
- 1514-1524
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2098254860
- Cited by
- 370
- References
- 14
- FWCI
- 29.91
- 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.