A System of P2P Contents Distribution Taking Advantage of Uneven Web Contents Distribution

In a peer-to-peer content distribution system, when the contents and queries classified by the semantic categories are submitted to a peer, the dominant rate is defined as the largest rate of the category distribution of each peer. We show that the higher the dominant rate, the more efficient distribution can be achieved in the system. It is also showed that the efficient distribution is achieved when the peers which have the same dominant category were neer one another. There is a dominant category in each web site. As many researches of web community, the web sites which have a same dominant category were strongly connected by hyperlink. Our proposed system takes advantage of such uneven distribution of web contents. We propose the peer-to-peer content distribution system with the way to enlarging dominant rate of each peer and to put the peers in the neighborhood that have a same dominant category. A prototype system is built on the cooperative Web architecture.

[1]  Ramesh Govindan,et al.  Using the small-world model to improve Freenet performance , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[3]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[4]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[5]  Ratul Mahajan,et al.  A Study of the Performance Potential of DHT-based Overlays , 2003, USENIX Symposium on Internet Technologies and Systems.

[6]  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.

[7]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[8]  Alhussein A. Abouzeid,et al.  Modeling and analysis of random walk search algorithms in P2P networks , 2005 .

[9]  Hector Garcia-Molina,et al.  Semantic Overlay Networks for P2P Systems , 2004, AP2PC.

[10]  Ben Y. Zhao,et al.  Locality Aware Mechanisms for Large-scale Networks , 2002 .

[11]  Monika Henzinger,et al.  Finding Related Pages in the World Wide Web , 1999, Comput. Networks.

[12]  Frank van Harmelen,et al.  Peer Selection in Peer-to-Peer Networks with Semantic Topologies , 2004, ICSNW.

[13]  Ravi Kumar,et al.  Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.

[14]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[15]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[16]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2002, SPAA '02.

[17]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[18]  Kazuhiro Kojima.  Self-Organizable P2P Document Search Engine for Knowledge Management , 2004, P2PKM.

[19]  村田 剛志.  参照の共起性に基づく Web コミュニティの発見 , 2001 .

[20]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[21]  Katsunori Yamaoka,et al.  Cooperative Web Architecture for Search and Navigation Assistance , 2002, ICWI.

[22]  Tsunenori Mine,et al.  Design and Implementation of Agent Community Based Peer-to-Peer Information Retrieval Method , 2004, CIA.

[23]  Sam Joseph,et al.  NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks , 2002, NETWORKING Workshops.

[24]  Katsunori Yamaoka,et al.  Efficient Content Location Algorithm for Content Distribution Networks based on Distributed Construction of Search Tree from Contents of Proximal Nodes , 2006, Databases and Applications.