This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Expiration Age-Based Document Placement Scheme for Cooperative Web Caching
May 2004 (vol. 16 no. 5)
pp. 585-600
Ling Liu, IEEE Computer Society

Abstract—The sharing of caches among proxies is an important technique to reduce Web traffic, alleviate network bottlenecks, and improve response time of document requests. Most existing work on cooperative caching has been focused on serving misses collaboratively. Very few have studied the effect of cooperation on document placement schemes and its potential enhancements on cache hit ratio and latency reduction. In this paper, we propose a new document placement scheme which takes into account the contentions at individual caches in order to limit the replication of documents within a cache group and increase document hit ratio. The main idea of this new scheme is to view the aggregate disk space of the cache group as a global resource of the group and uses the concept of cache expiration age to measure the contention of individual caches. The decision of whether to cache a document at a proxy is made collectively among the caches that already have a copy of this document. We refer to this new document placement scheme as the Expiration Age-based scheme (EA scheme for short). The EA scheme effectively reduces the replication of documents across the cache group, while ensuring that a copy of the document always resides in a cache where it is likely to stay for the longest time. We report our study on the potentials and limits of the EA scheme using both analytic modeling and trace-based simulation. The analytical model compares and contrasts the existing (ad hoc) placement scheme of cooperative proxy caches with our new EA scheme and indicates that the EA scheme improves the effectiveness of aggregate disk usage, thereby increasing the average time duration for which documents stay in the cache. The trace-based simulations show that the EA scheme yields higher hit rates and better response times compared to the existing document placement schemes used in most of the caching proxies.

[1] C. Aggarwal, J. Wolf, and P. Yu, "Caching on the World Wide Web," IEEE Trans. Knowledge and Data Eng., vol. 11, no. 1, 1999, pp. 94-107.
[2] T.E. Anderson, M.D. Dahlin, J.M. Neefe, D.A. Patterson, D.S. Roselli, and R.Y. Wang, Serverless Network File Systems ACM Trans. Computer Systems, Feb. 1996.
[3] A. Bestavros, R.L. Carter, M.E. Crovella, C.R. Cunha, A. Heddaya, and S. Mirdad, Application-Level Document Caching in the Internet Proc. Second Int'l Workshop Services in Distributed and Networked Environments, 1995.
[4] A. Chankhunthod, P. Danzig, C. Neerdaels, M. Schwartz, and K. Worell, A Hierarchical Internet Object Cache Proc. 1996 USENIX Technical Conf., Jan. 1996.
[5] L. Fan, P. Cao, J. Almeida, and A. Broder, Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Proc. ACM SIGCOMM '98, Sept. 1998.
[6] Internet Cache Protocol: Protocol Specification, version 2, Sept. 1997, http://icp.ircache.net/rfc2186.txt.
[7] S. Inohara, Y. Masuoka, J. Min, and F. Noda, Self-Organizing Cooperative WWW Caching Proc. 18th Int'l Conf. Distributed Computing Systems, 1998.
[8] D. Karger, A. Sherman, A. Berkheimer, B. Bogstad, R. Dhanidina, K. Iwamoto, B. Kim, L. Matkins, and Y. Yerushalmi, Web Caching with Consistent Hashing Proc. WWW-8, May 1997.
[9] M.R. Korupolu and M. Dahlin, Coordinated Placement and Replacement for Large-Scale Distributed Caches IEEE Trans. Knowledge and Data Eng., vol. 14, no. 6, Nov./Dec. 2002.
[10] S. Michel, K. Nguyen, A. Rosenstein, L. Zhang, S. Floyd, and V. Jacobson, Adaptive Web Caching: Towards a New Global Caching Architecture Computer Networks and ISDN Systems, Nov. 1998.
[11] M. Rabinovich and O. Spatscheck, Web Caching and Replication. Addison Wesley Professional, Dec. 2001.
[12] P. Rodriguez, C. Spanner, and E.W. Biersack, “Analysis of Web Caching Architectures: Hierarchical and Distributed Caching,” IEEE/ACM Trans. Networking, vol. 9, no. 4, pp. 404-418, Aug. 2001.
[13] K.W. Ross, “Hash Routing for Collections of Shared Web Caches,” IEEE Network, vol. 11, no. 6, pp. 37-44, Nov./Dec. 1997.
[14] A. Rousskov and V. Soloviev, A Performance Study of the Squid Proxy on HTTP/1.0 World Wide Web, vol. 2, nos. 1-2, Jan. 1999,
[15] P. Sarkar and J. Hartman, Efficient Cooperative Caching Using Hints Proc. USENIX Conf. Operating Systems Design and Implementation, Oct. 1996.
[16] R. Tewari, M. Dahlin, H.M. Vin, and J. Kay, Beyond Hierarchies: Design Considerations for Distributed Caching on the Internet Proc. 19th Int'l Conf. Distributed Computing Systems (ICDCS), June 1999.
[17] D. Thaler and C. Ravihsankar, Using Name-Based Mappings to Increase Hit Rates IEEE/ACM Trans. Networking, Feb. 1998.
[18] J. Wang, A Survey of Web Caching Schemes for the Internet ACM Computer Comm. Rev., Oct. 1999.
[19] D. Wessels, Web Caching. O'Reilly and Assoc., June 2001.
[20] A. Wolman, G.M. Voelkar, N. Sharma, N. Cardwell, A. Karlin, and H.M. Levy, On the Scale and Performance of Cooperative Web Proxy Caching Proc. ACM Symp. Operating Systems Principles '99, Dec. 1999.
[21] K.-L. Wu and P.S. Yu, “Load Balancing and Hot Spot Relief for Hash Routing among a Collection of Proxy Caches,” Proc. 19th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), pp. 536-543, June 1999.
[22] K.-L. Wu and P.S. Yu, Local Replication for Proxy Web Caches with Hash Routing Proc. ACM Eighth Int'l Conf. Information and Knowledge Management, 1999.
[23] K.-L. Wu and P.S. Yu, Latency Sensitive Hashing for Collaborative Web Caching Computer Networks, June 2000.
[24] K.-L. Wu and P.S. Yu, Replication for Load Balancing and Hot-Spot Relief on Proxy Web Cache with Hash Routing Distributed and Parallel Databases, vol. 13, no. 2, 2003.

Index Terms:
Cooperative Web caching, document placement, distributed caching.
Citation:
Lakshmish Ramaswamy, Ling Liu, "An Expiration Age-Based Document Placement Scheme for Cooperative Web Caching," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 5, pp. 585-600, May 2004, doi:10.1109/TKDE.2004.1277819
Usage of this product signifies your acceptance of the Terms of Use.