The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Cache “less for more” in information-centric networks (extended version)
Open accessAbstract
Ubiquitous in-network caching is one of the key aspects of information-centric networking (ICN) which has recently received widespread research interest. In one of the key relevant proposals known as Networking Named Content (NNC), the premise is that leveraging in-network caching to store content in every node it traverses along the delivery path can enhance content delivery. We question such indiscriminate universal caching strategy and investigate whether caching less can actually achieve more . Specifically, we investigate if caching only in a subset of node(s) along the content delivery path can achieve better performance in terms of cache and server hit rates. In this paper, we first study the behavior of NNC's ubiquitous caching and observe that even naive random caching at one intermediate node within the delivery path can achieve similar and, under certain conditions, even better caching gain. We propose a centrality-based caching algorithm by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy. Our results suggest that our solution can consistently achieve better gain across both synthetic and real network topologies that have different structural properties.
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
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
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,983
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
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
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
Evolution and Structure of the Internet: A Statistical Physics Approach
Pastor-Satorras, R., & Vespignani, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610905 · Cited by 1,310
Universal Behavior of Load Distribution in Scale-Free Networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.278701 · Cited by 1,246
Everett, M. G., & Borgatti, S. P. (2004) · Social Networks · doi:10.1016/j.socnet.2004.11.007 · Cited by 679
Probabilistic in-network caching for information-centric networks
Psaras, I., Chai, W. K., & Pavlou, G. (2012) · doi:10.1145/2342488.2342501 · Cited by 630
Self-citationHierarchical 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
Cited by
The Internet of Things vision: Key features, applications and open issues
Borgia, E. (2014) · Computer Communications · doi:10.1016/j.comcom.2014.09.008 · Cited by 1,471
Wang, C., Liang, C., Yu, F. R., Chen, Q., & Tang, L. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2703901 · Cited by 710
A Survey on Naming, Name Resolution and Data Routing in Information Centric Networking (ICN)
BARAKABITZE, A. A., XIAOHENG, T., & TAN, G. (2014) · IJARCCE · doi:10.17148/ijarcce.2014.31055 · Cited by 25
Metadata
- Authors
- Chai, W. K., He, D., Psaras, I., & Pavlou, G.
- Venue
- Computer Communications
- Publisher
- Elsevier BV
- Published
- 2013-04
- Volume
- 36
- Issue
- 7
- Pages
- 758-770
- ISSN
- 0140-3664 (ISSN-L)
- OpenAlex
- W2163020588
- Cited by
- 253
- References
- 30
- FWCI
- 33.92
- Type
- journal article
- 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
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.