The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On the placement of Web server replicas
Abstract
There has been an increasing deployment of content distribution networks (CDNs) that offer hosting services to Web content providers. CDNs deploy a set of servers distributed throughout the Internet and replicate provider content across these servers for better performance and availability than centralized provider servers. Existing work on CDNs has primarily focused on techniques for efficiently redirecting user requests to appropriate CDN servers to reduce request latency and balance load. However, little attention has been given to the development of placement strategies for Web server replicas to further improve CDN performance. We explore the problem of Web server replica placement in detail. We develop several placement algorithms that use workload information, such as client latency and request rates, to make informed placement decisions. We then evaluate the placement algorithms using both synthetic and real network topologies, as well as Web server traces, and show that the placement of Web replicas is crucial to CDN performance. We also address a number of practical issues when using these algorithms, such as their sensitivity to imperfect knowledge about client workload and network topology, the stability of the input data, and methods for obtaining the input.
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
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,679
Validation of subgradient optimization
Held, M., Wolfe, P., & Crowder, H. P. (1974) · Mathematical Programming · doi:10.1007/bf01580223 · Cited by 1,362
Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1977) · Management Science · doi:10.1287/mnsc.23.8.789 · Cited by 793
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
Teitz, M. B., & Bart, P. (1968) · Operations Research · doi:10.1287/opre.16.5.955 · Cited by 787
Internet Web servers: workload characterization and performance implications
Arlitt, M. F., & Williamson, C. L. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649565 · Cited by 730
A Hierarchical Internet Object Cache
Chankhunthod, A., Danzig, P. B., Neerdaels, C., Schwartz, M. F., & Worrell, K. J. (1995) · doi:10.21236/ada446612 · Cited by 689
Greedy strikes back: Improved Facility Location Algorithms
Guha, S., & Khuller, S. (1998) · Cited by 515
Cornuéjols, G., Fisher, M. L., & Nemhauser, G. L. (1979) · Management Science · doi:10.1287/mnsc.25.8.808 · Cited by 430
On the optimal placement of web proxies in the Internet
Li, B., Golin, M. J., Italiano, G. F., Deng, X., & Sohraby, K. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.752146 · Cited by 408
On network-aware clustering of Web clients
Krishnamurthy, B., & Wang, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347412 · Cited by 370
Web caching with consistent hashing
Karger, D., Sherman, A., Berkheimer, A., Bogstad, B., Dhanidina, R., Iwamoto, K., Kim, B., Matkins, L., & Yerushalmi, Y. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00055-9 · Cited by 285
On the placement of Internet instrumentation
Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., & Zhang, L. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832199 · Cited by 244
McManus, P. (2000) · Cited by 34
Cited by
Data Center Network Virtualization: A Survey
Bari, M. F., Boutaba, R., Esteves, R., Granville, L. Z., Podlesny, M., Rabbani, M. G., Zhang, Q., & Zhani, M. F. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.090512.00043 · Cited by 677
Content delivery networks: Status and trends
Vakali, A., & Pallis, G. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1250586 · Cited by 472
Insight and perspectives for content delivery networks
Pallis, G., & Vakali, A. (2006) · Communications of the ACM · doi:10.1145/1107458.1107462 · Cited by 421
On multiple description streaming with content delivery networks
Apostolopoulos, J., Wong, T., Tan, W.-T., & Wee, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019427 · Cited by 323
A Survey of Green Information-Centric Networking: Research Issues and Challenges
Fang, C., Yu, F. R., Huang, T., Liu, J., & Liu, Y. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2394307 · Cited by 268
Metadata
- Authors
- Qiu, L., Padmanabhan, V. N., & Voelker, G. M.
- Venue
- Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 3
- Pages
- 1587-1596
- OpenAlex
- W2167776925
- Cited by
- 798
- References
- 14
- FWCI
- 37.26
- Type
- conference paper
- 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.