The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Cache “Less for More” in Information-Centric Networks
Open accessOverview
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
A data-oriented (and beyond) network architecture
Koponen, T., Chawla, M., Chun, B.-G., Ermolinskiy, A., Kim, K. H., Shenker, S., & Stoica, I. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282402 · Cited by 1,368
A data-oriented (and beyond) network architecture
Koponen, T., Chawla, M., Chun, B.-G., Ermolinskiy, A., Kim, K. H., Shenker, S., & Stoica, I. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282402 · Cited by 719
Everett, M. G., & Borgatti, S. P. (2004) · Social Networks · doi:10.1016/j.socnet.2004.11.007 · Cited by 679
Hierarchical Web caching systems: modeling, design and experimental results
Che, H., Tung, Y., & Wang, Z. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.801752 · Cited by 491
LIPSIN: line speed publish/subscribe inter-networking
Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., & Nikander, P. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592592 · Cited by 434
The LCD interconnection of LRU caches and its analysis
Laoutaris, N., Che, H., & Stavrakakis, I. (2006) · Performance Evaluation · doi:10.1016/j.peva.2005.05.003 · Cited by 383
An approximate analysis of the LRU and FIFO buffer replacement schemes
Dan, A., & Towsley, D. (1990) · Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '90 · doi:10.1145/98457.98525 · Cited by 357
Information-centric networking: seeing the forest for the trees
Ghodsi, A., Shenker, S., Koponen, T., Singla, A., Raghavan, B., & Wilcox, J. (2011) · Proceedings of the 10th ACM Workshop on Hot Topics in Networks · doi:10.1145/2070562.2070563 · Cited by 321
Cited by
A Survey of Information-Centric Networking Research
Xylomenos, G., Ververidis, C. N., Siris, V. A., Fotiou, N., Tsilopoulos, C., Vasilakos, X., Katsaros, K. V., & Polyzos, G. C. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.070813.00063 · Cited by 1,348
A Survey of Caching Mechanisms in Information-Centric Networking
Zhang, M., Luo, H., & Zhang, H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2420097 · Cited by 360
Cache “less for more” in information-centric networks (extended version)
Chai, W. K., He, D., Psaras, I., & Pavlou, G. (2013) · Computer Communications · doi:10.1016/j.comcom.2013.01.007 · Cited by 253
Self-citationInvestigating the Performance of Pull-Based Dynamic Adaptive Streaming in NDN
Rainer, B., Posch, D., & Hellwagner, H. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2577365 · Cited by 62
Metadata
- Authors
- Chai, W. K., He, D., Psaras, I., & Pavlou, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 27-40
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1564544031
- Cited by
- 320
- References
- 14
- FWCI
- 33.67
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cache “Less for More” in Information-Centric Networks. https://app.cochat.ai/papers/10.1007/978-3-642-30045-5_3
- The paper
- Chai, W. K., He, D., Psaras, I., & Pavlou, G. (2012). Cache “Less for More” in Information-Centric Networks. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-30045-5_3
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.