The resource pooling principle
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
Since the ARPAnet, network designers have built localized mechanisms for statistical multiplexing, load balancing, and failure resilience, often without understanding the broader implications. These mechanisms are all types of resource pooling whichmeans making a collection of resources behave like a single pooled resource. We believe that the natural evolution of the Internet is that it should achieve resource pooling by harnessing the responsiveness of multipath-capable end systems. We argue that this approach will solve the problems and limitations of the current piecemeal approaches.
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
Perkins, C. E., Perkins, C. E., & Johnson, D. B. (1996) · Cited by 3,304
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
Web search for a planet: the google cluster architecture
Barroso, L. A., Dean, J., & Holzle, U. (2003) · IEEE Micro · doi:10.1109/mm.2003.1196112 · Cited by 1,025
Globally distributed content delivery
Dilley, J., Maggs, B., Parikh, J., Prokop, H., Sitaraman, R., & Weihl, B. (2002) · IEEE Internet Computing · doi:10.1109/mic.2002.1036038 · Cited by 691
The design philosophy of the DARPA Internet Protocols
Clark, D. D. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205458 · Cited by 396
Can ISPS and P2P users cooperate for improved performance?
Aggarwal, V., Feldmann, A., & Scheideler, C. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1273445.1273449 · Cited by 393
Report from the IAB Workshop on Routing and Addressing
Zhang, L., Meyer, D., & Fall, K. (2007) · Cited by 341
Report from the IAB Workshop on Routing and Addressing
(2007) · doi:10.17487/rfc4984 · Cited by 299
Achieving sub-second IGP convergence in large IP networks
Francois, P., Filsfils, C., Evans, J., & Bonaventure, O. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1070873.1070877 · Cited by 288 · cited 1×
“A single ISP can tweak OSPF to give faster reconvergence [5], and MPLS and link-layer path restoration can provide still faster conA C”
BackgroundDesigning DCCP: congestion control without reliability
Kohler, E., Handley, M., & Floyd, S. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159918 · Cited by 223
Self-citation
Cited by
Reining in the outliers in map-reduce clusters using Mantri
Ananthanarayanan, G., Kandula, S., Greenberg, A. G., Stoica, I. G., Lu, Y., Saha, B., & Harris, E. F. (2010) · Operating Systems Design and Implementation · doi:10.5555/1924943.1924962 · Cited by 636
Cloud computing service composition: A systematic literature review
Jula, A., Sundararajan, E., & Othman, Z. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.12.017 · Cited by 402
MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution
Khalili, R., Gast, N., Popovic, M., & Le Boudec, J.-Y. (2013) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2274462 · Cited by 339
Adaptive Bitrate Selection: A Survey
Sani, Y., Mauthe, A., & Edwards, C. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2725241 · Cited by 121
“Nonetheless, a number of researchers have attempted to improve the available bandwidth through various resource pooling techniques [120], whereby a collection of resources belonging to a system is treated as a single pool.”
BackgroundAli, S., Wadho, S. A., Yichiet, A., Gan, M. L., & Lee, C. K. (2024) · Egyptian Informatics Journal · doi:10.1016/j.eij.2024.100519 · Cited by 32
Metadata
- Authors
- Wischik, D., Handley, M., & Braun, M. B.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2008-09-30
- Volume
- 38
- Issue
- 5
- Pages
- 47-52
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2089641163
- Cited by
- 241
- References
- 14
- FWCI
- 35.66
- Type
- journal article
- Language
- en
- Open access
- green
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.