The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Network Optimization and Control
Abstract
We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves understanding what resources are, how to allocate them fairly, and perhaps most importantly, how to achieve this goal in a distributed and stable fashion. We start with ideas of a centralized optimization framework and show how congestion control, routing and scheduling in wired and wireless networks can be thought of as fair resource allocation. We then move to the study of controllers that allow a decentralized solution of this problem. These controllers are the analytical equivalent of protocols in use on the Internet today, and we describe existing protocols as realizations of such controllers. The Internet is a dynamic system with feedback delays and flows that arrive and depart, which means that stability of the system cannot be taken for granted. We show how to incorporate stability into protocols, and thus, prevent undesirable network behavior. Finally, we consider a futuristic scenario where users are aware of the effects of their actions and try to game the system. We will see that the optimization framework is remarkably robust even to such gaming.
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. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Philosophical transactions of the Royal Society of London. B
Press, H. (1886) · Cited by 10,080
A Theory of Justice: Original Edition
Rawls, J. (1971) · doi:10.4159/9780674042605 · Cited by 9,496
Nash, J. F. (1950) · Econometrica · doi:10.2307/1907266 · Cited by 7,840
COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
Vickrey, W. (1961) · The Journal of Finance · doi:10.1111/j.1540-6261.1961.tb02789.x · Cited by 7,722
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
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
Groves, T. (1973) · Econometrica · doi:10.2307/1914085 · Cited by 3,284
Multipart pricing of public goods
Clarke, E. H. (1971) · Public Choice · doi:10.1007/bf01726210 · Cited by 3,246
Charging and rate control for elastic traffic
Kelly, F. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080106 · Cited by 2,936
Feedback Control of Dynamic Systems
Franklin, G. F., Powell, D. J., & Emami-Naeini, A. (1986) · Cited by 2,293
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
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Chiu, D.-M., & Jain, R. (1989) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(89)90019-6 · Cited by 1,902
TCP Vegas: end to end congestion avoidance on a global Internet
Brakmo, L. S., & Peterson, L. L. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464716 · Cited by 1,699
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
Resource Allocation and Cross-Layer Control in Wireless Networks
Georgiadis, L., Neely, M. J., & Tassiulas, L. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019697 · Cited by 1,291
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347421 · Cited by 1,274
TCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
On designing improved controllers for AQM routers supporting TCP flows
Hollot, C. V., Misra, V., Towsley, D., & Gong, W.-B. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916670 · Cited by 958
FAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Computer Networks: A Systems Approach
Peterson, L., & Davie, B. S. (1996) · Cited by 954
Scalable TCP: improving performance in highspeed wide area networks
Kelly, T. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956981.956989 · Cited by 869
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-citationThe 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-citation(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
Efficiency Loss in a Network Resource Allocation Game
Johari, R., & Tsitsiklis, J. N. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0091 · Cited by 537
Control Techniques for Complex Networks
Meyn, S. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804410 · Cited by 528
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
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Kunniyur, S., & Srikant, R. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383069 · Cited by 490
Self-citationEnd-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
Self-citationFairness 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
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/347059.347421 · Cited by 427
Bandwidth sharing and admission control for elastic traffic
Massoulié, L., & Roberts, J. W. (2000) · Telecommunication Systems · doi:10.1023/a:1019138827659 · Cited by 372
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
Self-citationScalable laws for stable network congestion control
Paganini, F., Doyle, J., & Low, S. (2003) · Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228) · doi:10.1109/cdc.2001.980095 · Cited by 276
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
Liu, S., Başar, T., & Srikant, R. (2008) · Performance Evaluation · doi:10.1016/j.peva.2007.12.007 · Cited by 259
Self-citationRamakrishnan, K. K., & Jain, R. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205461 · Cited by 255
John Rawls: A Theory of Justice
(2014) · Central Works of Philosophy v5 · doi:10.4324/9781315712239-10 · Cited by 178
Yang, S., & Hajek, B. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.070817 · Cited by 163
Random early marking for Internet congestion control
Lapsley, D., & Low, S. H. (2003) · Globecom · doi:10.1109/glocom.1999.832461 · Cited by 133
Exponential-RED: a stabilizing AQM scheme for low- and high-speed TCP protocols
Liu, S., Başar, T., & Srikant, R. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2005.857110 · Cited by 127
Self-citationAIMD, fairness and fractal scaling of TCP traffic
Baccelli, F., & Hong, D. (2003) · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · doi:10.1109/infcom.2002.1019264 · Cited by 106
Liu, S., Başar, T., & Srikant, R. (2006) · doi:10.1145/1190095.1190166 · Cited by 93
Self-citationCommunication Requirements of VCG-Like Mechanisms in Convex Environments
Johari, R., & Tsitsiklis, J. N. (2006) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 50
Cited by
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Metadata
- Authors
- Shakkottai, S., & Srikant, R.
- Venue
- Foundations and Trends® in Networking
- Publisher
- Emerald
- Published
- 2007
- Volume
- 2
- Issue
- 3
- Pages
- 271-379
- ISSN
- 1554-057X (ISSN-L)
- 1554-0588
- OpenAlex
- W2058677708
- Cited by
- 320
- References
- 50
- FWCI
- 43.90
- 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.
