Improving Web Access Efficiency Using P2P Proxies

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.

[1]  W ReynoldsCraig Flocks, herds and schools: A distributed behavioral model , 1987 .

[2]  Joseph D. Touch,et al.  LSAM Proxy Cache: A Multicast Distributed Virtual Cache , 1998, Comput. Networks.

[3]  Leonard Kleinrock Distributed Systems , 1985, Computer.

[4]  Michael Dahlin,et al.  Design considerations for distributed caching on the Internet , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[5]  Jacob R. Lorch,et al.  Making World Wide Web Caching Servers Cooperate , 1996, World Wide Web J..

[6]  David R. Karger,et al.  Web Caching with Consistent Hashing , 1999, Comput. Networks.

[7]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[8]  Duane Wessels,et al.  Cache Digests , 1998, Comput. Networks.

[9]  Duane Wessels,et al.  ICP and the Squid web cache , 1998, IEEE J. Sel. Areas Commun..

[10]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[11]  Peter B. Danzig,et al.  A Hierarchical Internet Object Cache , 1996, USENIX ATC.

[12]  Syam Gadde,et al.  Reduce, reuse, recycle: an approach to building large Internet caches , 1997, Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133).

[13]  Ari Luotonen,et al.  World-Wide Web Proxies , 1994, Comput. Networks ISDN Syst..

[14]  Syam Gadde,et al.  Not all Hits are Created Equal: Cooperative Proxy Caching Over a Wide-Area Network , 1998, Comput. Networks.

[15]  John Harrison,et al.  A Distributed Internet Cache , 1997 .

[16]  Anja Feldmann,et al.  Performance of Web proxy caching in heterogeneous bandwidth environments , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[18]  Keith Ross,et al.  Cache Array Routing Protocol v1.1 , 1998 .

[19]  James Z. Wang,et al.  Data allocation algorithms for distributed video servers , 2000, MM 2000.