Abstract
Many cooperated web cache systems and protocols have been proposed. These systems, however, require expensive resources, such as external bandwidth and proxy cpu or storage, while inducing hefty administrative costs to achieve adequate client population growth. Moreover, a scalability problem in the cache server management still exists.
This paper suggests peer-to-peer client-clustering. The client-cluster provides a proxy cache with backup storage which is comprised of the residual resources of the clients. We use DHT based peer-to-peer lookup protocol to manage the client-cluster. With the natural characteristics of this protocol, the client-cluster is self-organizing, fault-tolerant, well-balanced and scalable. Additionally, we propose the Backward ICP which is used to communicate between the proxy cache and the client-cluster, to reduce the overhead of the object replication and to use the resources more efficiently.
We examine the performance of the client-cluster via a trace driven simulation and demonstrate effective enhancement of the proxy cache performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rodriguez, P., Spanner, C., Biersack, E.W.: Web caching architectures: Hierarchical and distributed caching. In: proceedings of the 4th International Web Caching Workshop (1999)
Chankhunthod, A., Danzig, P.B., Neerdaels, C., Schwartz, M.F., Worrell, K.J.: A hierarchical internet object cache. In: proceedings of the 1996 Usenix Technical Conference (January 1996)
Cohen, J., Phadnis, N., Valloppillil, V., Ross, K.W.: Cache Array Routing Protocol v1.0 (September 1997), http://www.ietf.org/internet-drafts/draft-vinod-carp-v1-03.txt
Wolman, A., Voelker, G.M., Sharma, N., Cardwell, N., Karlin, A., Levy, H.M.: On the scale and performance of cooperative Web proxy caching. In: proceedings of the 17th ACM symposium on Operating Systems Principles (December 1999)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: proceedings of the International Conference on Distributed Systems Platforms (November 2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peerto- peer lookup service for Internet applications. In: proceedings of ACM SIGCOMM 2001 (August 2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: proceedings of ACM SIGCOMM 2001 (August 2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-tolerant Widearea Location and Routing. In UCB Technical Report UCB/CSD-01-114 (2001)
Iyer, S., Rowstron, A., Druschel, P.: Squirrel: A decentralized peer-to-peer web cache. In: Proceedings of Principles of Distributed Computing 2002 (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
Kim, K., Kim, W.J., Park, D. (2003). Efficient and Scalable Client-Clustering for Proxy Cache. In: Freire, M.M., Lorenz, P., Lee, M.MO. (eds) High-Speed Networks and Multimedia Communications. HSNMC 2003. Lecture Notes in Computer Science, vol 2720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45076-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-45076-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40542-9
Online ISBN: 978-3-540-45076-4
eBook Packages: Springer Book Archive