The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Fundamental design issues for the future Internet
Abstract
The Internet has been a startling and dramatic success. Originally designed to link together a small group of researchers, the Internet is now used by many millions of people. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the technical foundations of the Internet. We address some of the fundamental architectural design issues facing the future Internet. In particular, we discuss whether the Internet should adopt a new service model, how this service model should be invoked, and whether this service model should include admission control. These architectural issues are discussed in a nonrigorous manner, through the use of a utility function formulation and some simple models. While we do advocate some design choices over others, the main purpose here is to provide a framework for discussing the various architectural alternatives.>
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
An Architecture for Differentiated Service
Blake, S. L., Black, D. L., Carlson, M., Davies, E., Wang, Z., & Weiss, W. (1998) · Cited by 5,487
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Integrated Services in the Internet Architecture: an Overview
Braden, R., Clark, D., & Shenker, S. (1994) · doi:10.17487/rfc1633 · Cited by 3,145
Self-citationAnalysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Self-citationCongestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Self-citationEquivalent capacity and its application to bandwidth allocation in high-speed networks
Guerin, R., Ahmadi, H., & Naghshineh, M. (1991) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.103545 · Cited by 1,311
A scheme for real-time channel establishment in wide-area networks
Ferrari, D., & Verma, D. C. (1990) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.53013 · Cited by 1,029
Cited by
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
Charging and rate control for elastic traffic
Kelly, F. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080106 · Cited by 2,936
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
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
Network Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions
Afolabi, I., Taleb, T., Samdanis, K., Ksentini, A., & Flinck, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2815638 · Cited by 1,078
Achieving MAC layer fairness in wireless packet networks
Nandagopal, T., Kim, T.-E., Gao, X., & Bharghavan, V. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345925 · Cited by 659
Auction-Based Spectrum Sharing
Huang, J., Berry, R. A., & Honig, M. L. (2006) · Mobile Networks and Applications · doi:10.1007/s11036-006-5192-y · Cited by 615
Cognitive internet of things: A new paradigm beyond connection
Wu, Q., Ding, G., Xu, Y., Feng, S., Du, Z., Wang, J., & Long, K. (2014) · IEEE Internet of Things Journal · doi:10.1109/jiot.2014.2311513 · Cited by 550
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Resource pricing and the evolution of congestion control
Gibbens, R. J., & Kelly, F. P. (1999) · Automatica · doi:10.1016/s0005-1098(99)00135-1 · Cited by 544
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
Aganagic, M., Klemm, A., Mari�o, M., & Vafa, C. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1162-z · Cited by 522
NVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks
Kokku, R., Mahindra, R., Zhang, H., & Rangarajan, S. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2179063 · Cited by 329
An analytical model for predicting the remaining battery capacity of lithium-ion batteries
Rong, P., & Pedram, M. (2006) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2006.876094 · Cited by 321
Utility-based resource allocation and scheduling in OFDM-based wireless broadband networks
Song, G., & Li, Y. (2005) · IEEE Communications Magazine · doi:10.1109/mcom.2005.1561930 · Cited by 290
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
Huang, J., Subramanian, V., Agrawal, R., & Berry, R. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090213 · Cited by 278
Metadata
- Authors
- Shenker, S.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 1995-09
- Volume
- 13
- Issue
- 7
- Pages
- 1176-1188
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2156568423
- Cited by
- 1,097
- References
- 20
- FWCI
- 21.10
- 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.