An approach based on locality-awareness and interest-focusing for web content distribution in P2P networks

A growing number of collaboration application are being built on top of Peer-to-Peer (P2P) networks which provide scalability and support dynamic behavior. However, the P2P networks is built over physical network and each node is logically connected to its neighbor, which lead to data transfers over long distance between nodes as well as to cause high latency and communication overheads. In this paper we propose an approach that exploits the locality information and content information between peers to distribute content rapidly in P2P networks. The idea is that peers keep the web content they accessed and serve it to other peers that are close to them in locality, then the peers build a structured which similar to Kademlia content overlay identified by locality and website. When a new client requests some content from a website, an improved-DHT quickly find an index-peer which ensure the nearest neighborhood peer that has the content available in the locality. According to the heterogeneity of peers, we present a formula to select an optimal peer from the content peers as the index-peer to charge them. Combine with the physical network layout, the website server and index-peers establish a tree structure to change information between them. After a complete theoretical analysis, the new complex structure takes advantage of the actual physical proximity of peers in the P2P networks to reduce network latency, and improves the speed of site content distribution and the site access.

[1]  Antony I. T. Rowstron,et al.  Squirrel: a decentralized peer-to-peer web cache , 2002, PODC '02.

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

[3]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[4]  Esther Pacitti,et al.  Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN , 2009, EDBT '09.

[5]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[6]  Venkata N. Padmanabhan,et al.  The Case for Cooperative Networking , 2002, IPTPS.

[7]  Peter Triantafillou,et al.  AESOP: Altruism-Endowed Self-organizing Peers , 2004, DBISP2P.

[8]  Esther Pacitti,et al.  A Topology-Aware Approach for Distributed Data Reconciliation in P2P Networks , 2007, Euro-Par.

[9]  Lei Chen,et al.  Optimal proactive caching in peer-to-peer network: analysis and application , 2007, CIKM '07.

[10]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[11]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  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).