The DOI matches its OpenAlex record; 55 of the 55 references it cites were found in a registry or an index.
Stochastic Network Optimization with Application to Communication and Queueing Systems
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Charging and rate control for elastic traffic
Kelly, F. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080106 · Cited by 2,936
Mobility increases the capacity of ad hoc wireless networks
Grossglauser, M., & Tse, D. N. C. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801403 · Cited by 2,839
Tassiulas, L., & Ephremides, A. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.182479 · Cited by 2,834
Foundations of Modern Probability
Kallenberg, O. (2002) · Probability and Its Applications · doi:10.1007/978-1-4757-4015-8 · Cited by 2,447
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
Constrained Markov Decision Processes: Stochastic Modeling
Altman, E. (2021) · Routledge eBooks · doi:10.1201/9781315140223 · Cited by 1,693
Williams, D. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813658 · Cited by 1,691
Approximate Dynamic Programming: Solving the Curses of Dimensionality
Powell, W. B. (2007) · Wiley Series in Probability and Statistics · doi:10.1002/9780470182963 · Cited by 1,566
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
Providing quality of service over a shared wireless link
Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Whiting, P., & Vijayakumar, R. (2001) · IEEE Communications Magazine · doi:10.1109/35.900644 · Cited by 1,197
Resource Allocation and Cross-Layer Control in Wireless Networks
Georgiadis, L., Neely, M. J., & Tassiulas, L. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000001 · Cited by 1,040
Self-citationAchieving 100% throughput in an input-queued switch
McKeown, N., Mekkittikul, A., Anantharam, V., & Walrand, J. (1999) · IEEE Transactions on Communications · doi:10.1109/26.780463 · Cited by 838
Introduction to Probability Models
Babu, G. J., & Ross, S. M. (1998) · Technometrics · doi:10.1080/00401706.1998.10485493 · Cited by 826
Communication over fading channels with delay constraints
Berry, R. A., & Gallager, R. G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.995554 · Cited by 761
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
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Jiang, L., & Walrand, J. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2035046 · Cited by 635
Optimal routing, link scheduling and power control in multihop wireless networks
Cruz, R. L., & Santhanam, A. V. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208720 · Cited by 610
Dynamic power allocation and routing for time-varying wireless networks
Neely, M. J., Modiano, E., & Rohrs, C. E. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837349 · Cited by 596
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
A framework for opportunistic scheduling in wireless networks
Liu, X., Chong, E. K. P., & Shroff, N. B. (2003) · Computer Networks · doi:10.1016/s1389-1286(02)00401-2 · Cited by 509
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
Energy-efficient packet transmission over a wireless link
Uysal-Biyikoglu, E., Prabhakar, B., & El Gamal, A. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801419 · Cited by 496
The throughput of data switches with and without speedup
Dai, J. G., & Prabhakar, B. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832229 · Cited by 469
Fairness and Optimal Stochastic Control for Heterogeneous Networks
Neely, M. J., Modiano, E., & Li, C.-P. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.900405 · Cited by 433
Self-citationRate 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
Eryılmaz, A., & Srikant, R. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897944 · Cited by 300
Non-convex optimization and rate control for multi-class services in the Internet
Lee, J.-W., Mazumdar, R. R., & Shroff, N. B. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2005.852876 · Cited by 281
Stability of queueing networks and scheduling policies
Kumar, P. R., & Meyn, S. (1995) · IEEE Transactions on Automatic Control · doi:10.1109/9.341782 · Cited by 280
Power-Aware Speed Scaling in Processor Sharing Systems
Wierman, A., Andrew, L. L. H., & Tang, A. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5062123 · Cited by 262
(2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347 · Cited by 259
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
A Calculus Approach to Energy-Efficient Data Transmission With Quality-of-Service Constraints
Zafer, M. A., & Modiano, E. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2020831 · Cited by 225
Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks
Urgaonkar, R., & Neely, M. J. (2009) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2009.38 · Cited by 211
Self-citationRate performance objectives of multihop wireless networks
Radunovic, B., & Le Boudec, J. Y. (2004) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2004.45 · Cited by 207
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
Wu, X., Srikant, R., & Perkins, J. R. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1061 · Cited by 181
Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks
Neely, M. J. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.903141 · Cited by 162
Self-citationA distributed CSMA algorithm for throughput and utility maximization in wireless networks
Jiang, L., & Walrand, J. (2008) · 2008 46th Annual Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797741 · Cited by 162
Analyzing Glauber dynamics by comparison of Markov chains
Randall, D., & Tetali, P. (2000) · Journal of Mathematical Physics · doi:10.1063/1.533199 · Cited by 148
DiffQ: Practical Differential Backlog Congestion Control for Wireless Networks
Warrier, A. C., Janakiraman, S., Ha, S., & Injong Rhee, Y. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5061929 · Cited by 145
Salodkar, N., Bhorkar, A., Karandikar, A., & Borkar, V. S. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080514 · Cited by 142
A simple local-control approximation algorithm for multicommodity flow
Awerbuch, B., & Leighton, T. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366841 · Cited by 141
Horizon: balancing tcp over multiple paths in wireless mesh network
Radunović, B., Gkantsidis, C., Gunawardena, D., & Key, P. B. (2008) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/1409944.1409973 · Cited by 137
A calculus approach to minimum energy transmission policies with quality of service guarantees
Zafer, M. A., & Modiano, E. (2005) · doi:10.1109/infcom.2005.1497922 · Cited by 113
Djonin, D. V., & Krishnamurthy, V. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.893228 · Cited by 90
Dynamic global packet routing in wireless networks
Kahalé, N., & Wright, P. E. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1997.631182 · Cited by 76
Is fair allocation always inefficient
Tang, A., Wang, J., & Low, S. H. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354479 · Cited by 67
Intelligent Packet Dropping for Optimal Energy-Delay Tradeoffs in Wireless Downlinks
Neely, M. J. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2013652 · Cited by 63
Self-citationDynamic product assembly and inventory control for maximum profit
Neely, M. J., & Huang, L. (2010) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2010.5717235 · Cited by 61
Self-citationCONTROL TECHNIQUES FOR COMPLEX NETWORKS
Meyn, S. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804410.003 · Cited by 55
Minimum Energy Transmission Over a Wireless Channel With Deadline and Power Constraints
Zafer, M. A., & Modiano, E. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2034202 · Cited by 54
DiffQ: Differential Backlog Congestion Control for Wireless Multi-hop Networks
Warrier, A. C., Ha, S., Wason, P., Injong Rhee, Y., & Kim, J. H. (2008) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2008.78 · Cited by 16
Cited by
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
A Survey on Device-to-Device Communication in Cellular Networks
Asadi, A., Wang, Q., & Mancuso, V. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2319555 · Cited by 1,824
Dynamic computation offloading for mobile-edge computing with energy harvesting devices
Mao, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611964 · Cited by 1,705
Update or Wait: How to Keep Your Data Fresh
Sun, Y., Uysal-Biyikoglu, E., Yates, R. D., Koksal, C. E., & Shroff, N. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2735804 · Cited by 817
FemtoCaching: Wireless video content delivery through distributed caching helpers
Golrezaei, N., Shanmugam, K., Dimakis, A. G., Molisch, A. F., & Caire, G. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195469 · Cited by 711
Metadata
- Authors
- Neely, M. J.
- Venue
- Synthesis lectures on communication networks
- Publisher
- Morgan & Claypool Publishers
- Published
- 2010-01-01
- Volume
- 3
- Issue
- 1
- Pages
- 1-211
- ISSN
- 1935-4185 (ISSN-L)
- OpenAlex
- W2137152139
- Cited by
- 2,218
- References
- 55
- FWCI
- 80.96
- 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.