Improving Web Access Efficiency Using P2P Proxies

  • Ratan K. Guha
  • James Z. Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2571)


Recent studies have shown that caching data at the proxy server can improve the user response time for web document retrieval. However, a single cache proxy has a limited cache space, thus the amount of data that can be cached is limited. In this paper, we organize the distributed proxy servers into a group of peer-to-peer cache proxies. By exploiting the aggregate cache space and computing power, we can reduce the average user response time and improve our quality of services. Unlike some previous works that achieve the similar results by replacing the single proxy server with a cluster of servers, we simply link the existing distributed proxy servers using a set of rules for connection, data cache and data routing to build a self-organized scalable distributed P2P proxy caching system. Our simulation has proven the feasibility and effectiveness of our cache system. In addition, our P2P proxy cache system is configured using individual based model and is easy to implement in a large scale distributed environment.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Luotonen and K. Altis, World Wide Web proxies, Computer Networks and ISDN systems, First International Conference on WWW, 27(2):147–154, April 1994.Google Scholar
  2. [2]
    A. Feldmann, R. Caceres, F. Douglis, G. Glass and M. Rabinovich, Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments, Proceedings of InfoCom (1), pages 107–116, 1999.Google Scholar
  3. [3]
    A. Chankhunthod, P. B. Danzig, C. Neerdaels, M. F. Schwartz, and K. J. Worrel, A Hierarchical Internet object cache, proceedings of USENIX Annual Technical Conference, pp. 153–164, San Diego, CA, January, 1996.Google Scholar
  4. [4]
    Duane Wessels, K Claffy, ICP and the Squid Web Cache, IEEE Journal on Selected Areas in Communication, 16(3):345–357, 1998.CrossRefGoogle Scholar
  5. [5]
    Scott Michel, et al., Adaptive Web Caching: Towards a New Caching Architecture, the 3rd International WWW Caching Workshop, Manchester, England, June 1998.Google Scholar
  6. [6]
    P. Rodriguez, C. Spanner and E. W. Biersack, Web Caching Architecture: Hierarchical and Distributed Caching, the 4th International WWW Caching Workshop, San Diego, CA, March 1998.Google Scholar
  7. [7]
    R. Tewari, M. Dahlin, H. Vin and J. Kay, Beyond Hierarchies: Design Consideration for Distributed Caching on the Internet, Technical Report: TR98-04, Department of Computer Science, University of Texas at Austin, February 1998.Google Scholar
  8. [8]
    Joe Touch, The LSAM Proxy Cache-a Multicast Distributed Virtual Cache, the 3rd International WWW Caching Workshop, Manchester, England, June 1998.Google Scholar
  9. [9]
    V. Valloppillil and K. W. Ross, Cache array routing protocol v1.0, Internet Draft, <draftvinod-carp-v1-03.txt>, February 1998.Google Scholar
  10. [10]
    D. Dovey and J. Harrison, A Distributed Internet Cache. In 20th Australian Computer Science Conference, February 1997.Google Scholar
  11. [11]
    S. Gadde, M. Rabinovich and J. Chase, Reduce, Reuse, Recycle: A Approach to Building Large Internet Caches, in Workshop on Hot Topics in Operating Systems, pp. 93–98, May 1997.Google Scholar
  12. [12]
    Zheng Wang, Cachemesh: A Distributed Cache System for World Wide Web, the 2rd NLANT Web Caching Workshop, June 1997.Google Scholar
  13. [13]
    R. Malpani, J. Lorch and David Berger, Making World Wide Web Caching Servers Cooperate, the Fouth International World Wide Web Conference, Boston, MS, December 1995.Google Scholar
  14. [14]
    L. Fan, P. Cao, J. Almeida and A. Broder, Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol, IEEE/ACM Transactions on Networking, 8(3):281–293, 2000.CrossRefGoogle Scholar
  15. [15]
    Alex Rousskov and Duane Wessels, Cache Digests, Computer Networks and ISDN Systems, 30(22–23):2155–2168, June 1998.CrossRefGoogle Scholar
  16. [16]
    M. Rabinovich, J. Chase and S. Gadde, Not All Hits Are Created Equal: Cooperative Proxy Cache Over a Wide-Area Network, Computer Networks and ISDN Systems, 30(22–23):2253–2259, November 1998.CrossRefGoogle Scholar
  17. [17]
    David Karger et al., Consistent hashing and random trees: Distributed cachine protocols for relieving hot spots on the World Wide Web. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 654–663, 1997Google Scholar
  18. [18]
    David Karger et al., Web Caching with Consistent Hashing, the 8th international WWW conference, Toronto, Canada, May 11-14, 1999.Google Scholar
  19. [19]
    James Z. Wang and Ratan K. Guha, Data Allocation Algorithms for Distributed Video Servers. In Proceedings of ACM Multimedia, pages 456–459, Marina del Rey, California, November 2000.Google Scholar
  20. [20]
    Craig W. Reynolds, Flocks, Herds, and Schools: A Distributed Behavioral Model, in Computer Graphics, 21(4) (SIGGRAPH’ 87 Conference Proceedings) pages 25–34, 1987.Google Scholar
  21. [21]
    L. Kleinrock, Distributed System, invited paper for ACM/IEEE-CS Joint Special Issue: Communications of the ACM, Vol. 28, No. 11, pp. 1200–1213, November 1985.CrossRefGoogle Scholar
  22. [22]
    L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker, Web Caching and Zipf-like Distributions: Evidence and Implications, in proceedings of IEEE INFOCOM’99, pp. 126–134, March 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ratan K. Guha
    • 1
  • James Z. Wang
    • 2
  1. 1.SEECS- Computer ScienceUniversity of Central FloridaOrlandoUSA
  2. 2.Department of Computer ScienceClemson UniversityClemsonUSA

Personalised recommendations