Abstract
Hash routing is an emerging approach to coordinating a collection of collaborative proxy caches. Hash routing partitions the entire URL space among the proxy caches. Each partition is assigned to a cache server. Duplication of cache contents is eliminated. Client requests to a cache server for non-assigned-partition objects are forwarded to proper sibling caches. In the presence of access skew, the load level of the cache servers can be quite unbalanced, limiting the benefits of hash routing.
We examine an adaptable controlled replication (ACR) of non-assigned-partition objects in each cache server to reduce the load imbalance and relieve the problem of hot-spot references. Trace-driven simulations are conducted to study the effectiveness of ACR. The results show that (1) access skew exists, and the load of the cache servers tends to be unbalanced in hash routing; (2) with a relatively small amount of ACR, say 10% of the cachesize, significant improvements in load balance can be achieved; (3) ACR provides a very effective remedy for load imbalance due to hot-spot references; and (4) increasing the cache size does not improve load balance unless replication is allowed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Abrams et al., “Caching proxies: Limitations and potentials,” in Proc. of 4th Int. World Wide Web Conference, 1995.
C.C. Aggarwal et al., “On caching policies for web objects,” Technical Report, IBM T.J. Watson Research Center, 1996.
C.M. Bowman et al., “The harvest information discovery and access system,” in Proc. of 2nd Int.WorldWide Web Conference, 1994, pp. 763–771.
A. Chankhunthod et al., “Ahierarchical internet object cache,” in Proc. of 1996USENIXTechnical Conference, 1996.
Cisco System, “Scaling the internet web servers,” White paper, availavle at http://www.cisco.com/, Nov. 1997.
M. Colajanni, P.S. Yu, and D. Dias, “Analysis of task assignment policies in scalable distributed web-server system,” IEEE Trans. on Parallel and Distributed Systems, vol. 9, no. 6, pp. 585–600, 1998.
M.D. Dahlin et al., “Cooperative caching: Using remote client memory to improve file system performance,” in Proc. of 1st Symp. on Operating Systems Design and Implementation, 1994.
P. Danzig, “NetCache architecture and deployment,” in Proc. of 3rd International Caching Workshop, 1998.
D.M. Dias et al., “A scalable and highly available web server,” in Proc. of IEEE COMPCON Conf. on Technologies for the Information Superhighway, 1996, pp. 85–92.
Digital Equipment Corporation (merged with Compaq), “Digital's web proxy traces,” available at http://ftp.digital.com/pub/DEC/traces/proxy/webtraces.html, 1996.
L. Fan et al., “Summary cache: A scalable wide-area web cache sharing protocol,” in Proc. of SIGCOMM 98, 1998, pp. 254–265.
G. Goldszmidt and G. Hunt, “NetDispatcher: A TCP connection router,” Technical Report RC 20853, IBM T.J. Watson Research, May 1997.
D. Karger et al., “Web caching with consistent hashing,” in Proc. of 8th Int. World Wide Web Conference, 1999, pp. 125–136.
E.D. Katz, M. Butler, and R. McGrath, “A scalable HTTP server: The NCSA prototype,” Computer Networks and ISDN Systems, vol. 27, pp. 155–163, 1994.
T. Kwan, R. McGrath, and D.A. Reed, “NCSA's world wide web server: Design and performance,” IEEE Computer, pp. 68–74, 1995.
A. Leff, J.L. Wolf, and P.S. Yu, “Replication algorithms in a remote caching architecture,” IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 11, pp. 1185–1204, 1993.
K. Li and P. Hudak, “Memory coherence in shared virtual memory systems,” ACM Trans. on Computer Systems, vol. 7, no. 4, pp. 321–359, 1989.
R. Malpani, J. Lorch, and D. Berger, “Making world wide web caching servers cooperate,” in Proc. of 4th Int. World Wide Web Conference, 1995.
M.N. Nelson, B.B. Welch, and J.K. Ousterhout, “Caching in the sprite network file system,” ACM Trans. on Computer Systems, vol. 6, no. 1, pp. 134–154, 1988.
O. Pearson, “Squid: A user's guide,” available at http://www.squid-cache.org/, 2000.
K.W. Ross, “Hash-routing for collections of shared web caches,” IEEE Network Magazine, pp. 34–44, 1997.
V. Valloppillil and J. Cohen, “Hierarchical HTTP routing protocol,” Internet Draft, available at http://ircache.nlanr.net/Cache/ICP/draft-vinod-icp-traffic-dist-00.txt, April, 1997.
V. Valloppillil and K.W. Ross, “Cache array routing protocol v1.0,” Internet Draft, available at http://www.ircache.net/Cache/ICP/carp.txt, Feb. 1998.
D. Wessels, “Squid web proxy cache,” available at http://www.squid-cache.org/, 1998.
D. Wessels and K. Claffy, “Internet cache protocol version 2,” Internet Draft, available at http://ds.internic.net/internet-drafts/draft-wessels-icp–v2–00.txt.
N.J. Yeager and R.E. McGrath, Web Server Technology: The Advanced Guide for World Wide Web Information Providers, Morgan Kaufman: San Mateo, CA, 1996.
P.S. Yu and E.A. MacNair, “Performance study of a collaborative method for hierarchical caching in proxy servers,” Computer Networks and ISDN Systems, vol. 30, pp. 215–224, 1998.
G.K. Zipf, Human Behaviour and the Principles of Least Effort, Addison-Wesley: Cambridge, MA, 1949.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, KL., Yu, P.S. Replication for Load Balancing and Hot-Spot Relief on Proxy Web Caches with Hash Routing. Distributed and Parallel Databases 13, 203–220 (2003). https://doi.org/10.1023/A:1021519509203
Issue Date:
DOI: https://doi.org/10.1023/A:1021519509203