Abstract
In this paper, we present the Dichotomized Cache Management (DCM) scheme for Web caches. The motivation of the DCM scheme is discovered by observing the Web reference behavior from the viewpoint of Belady’s optimal replacement algorithm. The observation shows that 1) separate allocation of cache space for temporal locality and reference popularity better approximates the optimal algorithm, and 2) the contribution of temporal locality and reference popularity on the performance of caching is dependent on the cache size. With these observations, we devise the DCM scheme that provides a robust framework for on-line detection and allocation of cache space based on the marginal contribution of temporal locality and reference popularity. Trace-driven simulations with actual Web cache logs show that DCM outperforms existing schemes for various performance measures for a wide range of cache configurations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Coffman, E.G., Denning, P.J.: Operating Systems Theory, ch. 6, pp. 241–283. Prentice-Hall, Englewood Cliffs (1973)
Hosseini-Khayat, S.: On Optimal Replacement of Non-uniform Cache Objects. IEEE Trans. Computers 49(8), 769–778 (2000)
Shim, J., Scheuermann, P., Vingralek, R.: Proxy Cache Design: Algorithms, Implementation and Performance. IEEE Trans. Knowledge and Data Eng. 11(4), 549–562 (1999)
Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web Caching and Zipf-like Distributions: Evidence and Implications. In: Proc. IEEE INFOCOM, pp. 126–134 (1999)
Lee, D., Choi, J., Kim, J., Noh, S.H., Min, S.L., Cho, Y., Kim, C.: On the Existence of a Spectrum of Policies that Subsumes the LRU and LFU Policies. In: Proc. 1999 ACM SIGMETRICS Conf., pp. 134–143 (1999)
DEC Proxy Cache Traces, ftp://ftp.digital.com/pub/DEC/traces/
NLANR Proxy Cache Traces, ftp://ircache.nlanr.net/Traces
Cao, P., Irani, S.: Cost-Aware WWW Proxy Caching Algorithms. In: Proc. 1st USENIX Symp. Internet Technology and Systems, pp. 193–206 (1997)
Rizzo, L., Vicisano, L.: Replacement Policies for a Proxy Cache. IEEE/ACM Trans. Networking 8(2), 158–170 (2000)
Aggarwal, C., Wolf, J., Yu, P.: Caching on theWorld Wide Web. IEEE Trans. Knowledge and Data Eng. 11(1), 94–107 (1999)
Choi, J., Noh, S.H., Min, S.L., Cho, Y.: Towards Application/File-Level Characterization of Block References: A Case for Fine-Grained Buffer Management. In: Proc. 2000 ACM SIGMETRICS Conf., pp. 286–295 (2000)
Kim, J.M., Choi, J., Kim, J., Noh, S.H., Min, S.L., Cho, Y., Kim, C.S.: A Low- Overhead, High-Performance Unified Buffer Management Scheme that Exploits Sequential and Looping References. In: Proc. 4th Symp. Operating Systems Design and Implementation (OSDI 2000), San Diego, CA, pp. 119–134 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bahn, H., Noh, S.H. (2003). Characterization of Web Reference Behavior Revisited: Evidence for Dichotomized Cache Management. In: Kahng, HK. (eds) Information Networking. ICOIN 2003. Lecture Notes in Computer Science, vol 2662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45235-5_100
Download citation
DOI: https://doi.org/10.1007/978-3-540-45235-5_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40827-7
Online ISBN: 978-3-540-45235-5
eBook Packages: Springer Book Archive