The DOI matches its Crossref record.
Approximate Models for General Cache Networks
Abstract
Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multi-cache systems are not well understood, especially in networks with arbitrary topologies. In order to gain insight into and manage these systems, a low-complexity algorithm for approximating their behavior is required. We propose a new algorithm, termed a-Net, that approximates the behavior of multi-cache networks by leveraging existing approximation algorithms for isolated LRU caches. We demonstrate the utility of a-Net using both per- cache and network-wide performance measures. We also perform factor analysis of the approximation error to identify system parameters that determine the precision of a-Net.
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
Caching in information centric networking: A survey
Zhang, G., Li, Y., & Lin, T. (2013) · Computer Networks · doi:10.1016/j.comnet.2013.07.007 · Cited by 358
A versatile and accurate approximation for LRU cache performance
Fricker, C., Robert, P., & Roberts, J. W. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.3974 · Cited by 257
Exact analysis of TTL cache networks
Berger, D. S., Gland, P., Singla, S., & Ciucu, F. (2014) · Performance Evaluation · doi:10.1016/j.peva.2014.07.001 · Cited by 95
Metadata
- Authors
- Rosensweig, E. J., Kurose, J., & Towsley, D.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-9
- OpenAlex
- W2068309140
- Cited by
- 208
- References
- 0
- FWCI
- 11.85
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximate Models for General Cache Networks. https://app.cochat.ai/papers/10.1109/infcom.2010.5461936
- The paper
- Rosensweig, E. J., Kurose, J., & Towsley, D. (2010). Approximate Models for General Cache Networks. 2010 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2010.5461936
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.
