The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Hierarchical Web caching systems: modeling, design and experimental results
Abstract
This paper aims at finding fundamental design principles for hierarchical Web caching. An analytical modeling technique is developed to characterize an uncooperative two-level hierarchical caching system where the least recently used (LRU) algorithm is locally run at each cache. With this modeling technique, we are able to identify a characteristic time for each cache, which plays a fundamental role in understanding the caching processes. In particular, a cache can be viewed roughly as a low-pass filter with its cutoff frequency equal to the inverse of the characteristic time. Documents with access frequencies lower than this cutoff frequency have good chances to pass through the cache without cache hits. This viewpoint enables us to take any branch of the cache tree as a tandem of low-pass filters at different cutoff frequencies, which further results in the finding of two fundamental design principles. Finally, to demonstrate how to use the principles to guide the caching algorithm design, we propose a cooperative hierarchical Web caching architecture based on these principles. Both model-based and real trace simulation studies show that the proposed cooperative architecture results in more than 50% memory saving and substantial central processing unit (CPU) power saving for the management and update of cache entries compared with the traditional uncooperative hierarchical caching architecture.
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
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
Probability and Random Processes
(2004) · Elsevier eBooks · doi:10.1016/b978-0-12-172651-5.x5000-3 · Cited by 2,535
Cost-aware WWW proxy caching algorithms
Cao, P., & Irani, S. (1997) · Cited by 925
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
A survey of web caching schemes for the Internet
Wang, J. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505696.505701 · Cited by 682
Probability and Random Processes.
Foutz, R. V., Grimmett, G. R., & Stirzaker, D. R. (1993) · Journal of the American Statistical Association · doi:10.2307/2291308 · Cited by 646
Characteristics of WWW Client-based Traces
Cunha, C. R., Azer Bestavros, C., & Crovella, M. E. (1995) · Cited by 526
Caching Proxies: Limitations and Potentials
Abrams, M., Standridge, C. R., Abdulla, G., Williams, S., & Fox, E. A. (1995) · Proceedings of the Fourth International Conference on World Wide Web · doi:10.1145/3592626.3592635 · Cited by 443
Analysis and design of hierarchical Web caching systems
Che, H., Wang, Z., & Tung, Y.-Y. (2002) · doi:10.1109/infcom.2001.916637 · Cited by 121
Self-citation
Cited by
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
Self-citationCaching 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
Cache “Less for More” in Information-Centric Networks
Chai, W. K., He, D., Psaras, I., & Pavlou, G. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-30045-5_3 · Cited by 320
Security, Privacy, and Access Control in Information-Centric Networking: A Survey
Tourani, R., Misra, S., Mick, T., & Panwar, G. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2749508 · Cited by 284
The Role of Caching in Future Communication Systems and Networks
Paschos, G. S., Iosifidis, G., Tao, M., Towsley, D., & Caire, G. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2844939 · Cited by 259
Metadata
- Authors
- Che, H., Tung, Y., & Wang, Z.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2002-09
- Volume
- 20
- Issue
- 7
- Pages
- 1305-1314
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2150495639
- Cited by
- 491
- References
- 10
- FWCI
- 3.59
- 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
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.