Abstract
Web caching is an effective Web performance enhancement technique that has been used widely. Web caching aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popular content on proxy caches that are strategically placed within the network. The replacement algorithm is the key to Web caching. This paper introduces a novel cache replacement algorithm, Site-Role Based GreedyDual-Size (termed SRB-GDS), which is a generalization of GreedyDual-Size. We argue that each website has different roles on different proxies. The proxy residing at the network edge has special characteristic that reflects the common interests of the community behind the proxy. According to its business, a community has its own interests, thus having its own favorite websites. However, this information is seldom incorporated in cache replacement algorithm policies. In addition to the consideration of the recently passed time, the size and the access cost of the document, the site role on proxy is also taken into account in SRB-GDS. Our trace-driven simulation experiment results have shown the superior performance of SRB-GDS when compared to other Web cache replacement policies proposed in the literature.
This work was supported by the National Key Basic Research Plan project (973) under the grant No. G1999032710.
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
Cao, P., Irani, S.: Cost-Aware www proxy caching algorithms. In: Proceedings of the, USENIX Symposium on Internet Technology and Systems, pp. 193–206 (1997)
Williams, S., Abrams, M., Standbridge, C.R., Abdulla, G., Fox, E.A.: Removal Policies in Network Caches For World-Wide Web Documents. In: Proceedings of the ACM Sigcomm 1996. Standford University, Standford (August 1996)
Aggarwal, C., Wolf, J.L., Yu, P.S.: Caching on the World Wide Web. IEEE Transactions on Knowledge and Data Engineering 11(1), 94–106 (1999)
Arlitt, M.F., Cherkasova, L., Dilley, J., Friedrich, R., Jin, T.: Evaluating Content Management Techniques forWeb Proxy Caches. In: Second Workshop on Internet Server Performance – WISP 1999, Atlanta, Georgia (1999); In conjunction with ACM Sigmetrics 1999
Arlitt, M.F., Friedrich, R., Jin, T.: Performance Evaluation of Web Proxy Cache Replacement Policies. Erformance Evaluation 40(4), 149–164 (2000)
Wooster, R., Abrams, M.: Proxy Caching the Estimates Pages Load Delays. In: The 6th International World Wide Web Conference, Santa Clara, CA, April 7–11 (1997)
Murta, C.D., Almeida, V.: Using Performance Maps to Understand the Behavior of Web Caching Policies. In: The 2nd IEEE Workshop on Internet Applications, San Jose, CA, July 23–24 (2001)
Hosseini-Khayat, S.: On Optimal Replacement of Nonuniform Cache Objects. IEEE Transactions on Computers 49(8), 769–778 (2000)
Jin, S., Bestavros, A.: Popularity-aware GreedyDual-Size Web proxy caching algorithms. In: Proceedings of IEEE ICDCS (2000)
Bahn, H., Noh, S.H., Min, S.L., Koh, K.: Using Full Reference History for Efficient Document Replacement in Web Caches. In: proceedings of USITS 1999, Boulder, Colorado (1999)
Dolev, D., Mokryn, O., Shavitt, Y., Sukhov, I.: An Integrated Architecture for The Scalable Delivery of Semi-Dynamic Web Content. In: Proceedings of the IEEE Symposium on Computers and Communications, Italy, July 2002. IEEE, Los Alamitos (2002)
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
Zhang, X., Qian, D., Wu, D., Liu, Y., Liu, T. (2003). Site-Role Based GreedyDual-Size Replacement Algorithm. In: Dong, G., Tang, C., Wang, W. (eds) Advances in Web-Age Information Management. WAIM 2003. Lecture Notes in Computer Science, vol 2762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45160-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-45160-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40715-7
Online ISBN: 978-3-540-45160-0
eBook Packages: Springer Book Archive