Algorithmic Nuggets in Content Delivery
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
This paper "peeks under the covers" at the subsystems that provide the basic functionality of a leading content delivery network. Based on our experiences in building one of the largest distributed systems in the world, we illustrate how sophisticated algorithmic research has been adapted to balance the load between and within server clusters, manage the caches on servers, select paths through an overlay routing network, and elect leaders in various contexts. In each instance, we first explain the theory underlying the algorithms, then introduce practical considerations not captured by the theoretical models, and finally describe what is implemented in practice. Through these examples, we highlight the role of algorithmic research in the design of complex networked systems. The paper also illustrates the close synergy that exists between research and industry where research ideas cross over into products and product requirements drive future research.
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
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492 · cited 1×
“Bloom filters were first introduced by Burton Bloom [7] and have found numerous elegant applications in networking [8].”
MethodThe Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023 · cited 1×
“The server failure model assumed by the algorithm designers is that a server may cease to function at any instant in time, and may likewise resume at any instant, but will not operate in a malicious or Byzantine [21] manner.”
MethodCollege Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
In search of an understandable consensus algorithm
Ongaro, D., & Ousterhout, J. K. (2014) · USENIX Annual Technical Conference · Cited by 3,398
Network flows: Theory, algorithms and applications
(1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90171-6 · Cited by 2,585
Pasteur's Quadrant: Basic Science and Technological Innovation
Tierney, W. G., Stokes, D. E., & Abbott, A. (2005) · Academe · doi:10.2307/40253438 · Cited by 2,077
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991 · cited 1×
“Bloom filters were first introduced by Burton Bloom [7] and have found numerous elegant applications in networking [8].”
MethodKarger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258660 · Cited by 1,981 · cited 1×
“Consistent hashing [17, 22] is used by the CDN to balance the load within a single cluster of servers.”
Pasteur's Quadrant: Basic science and technological innovation
Brandl, J. E. (1998) · Journal of Policy Analysis and Management · doi:10.1002/(sici)1520-6688(199823)17:4<734::aid-pam10>3.0.co;2-g · Cited by 1,836
Cited by
Cachier: Edge-Caching for Recognition Applications
Drolia, U., Guo, K., Tan, J., Gandhi, R., & Narasimhan, P. (2017) · 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2017.94 · Cited by 148
Metadata
- Authors
- Maggs, B. M., & Sitaraman, R. K.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2015-07-13
- Volume
- 45
- Issue
- 3
- Pages
- 52-66
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2406213739
- Cited by
- 242
- References
- 26
- FWCI
- 27.25
- 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.