The DOI matches its Crossref record.
Constrained mirror placement on the Internet
Abstract
Web content providers and content distribution network (CDN) operators often set up mirrors of popular content to improve performance. Due to the scale and decentralized administration of the Internet, companies have a limited number of sites (relative to the size of the Internet) where they can place mirrors. We formalize the mirror placement problem as a case of constrained mirror placement, where mirrors can only be placed on a preselected set of candidates. We study performance improvement in terms of client round-trip time (RTT) and server load when clients are clustered by the autonomous systems (AS) in which they reside. Our results show that, regardless of the mirror placement algorithm used, for only a surprisingly small range of values there is an increase in the number of mirror sites (under the constraint) effective in reducing the client to server RTT and server load. In this range, we show that greedy placement performs the best.
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
Cited by
A survey on service function chaining
Bhamare, D., Jain, R., Samaka, M., & Erbad, A. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.09.001 · Cited by 331
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 on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
Metadata
- Authors
- Cronin, E., Jamin, S., Jin, C., Kurc, A. R., Raz, D., & Shavitt, Y.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2002-09
- Volume
- 20
- Issue
- 7
- Pages
- 1369-1382
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2481666560
- Cited by
- 162
- References
- 0
- FWCI
- 14.37
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Constrained mirror placement on the Internet. https://app.cochat.ai/papers/10.1109/jsac.2002.802066
- The paper
- Cronin, E., Jamin, S., Jin, C., Kurc, A. R., Raz, D., & Shavitt, Y. (2002). Constrained mirror placement on the Internet. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2002.802066
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.
