Scalable Blind Search and Broadcasting in Peer-to-Peer Networks

Typical blind search algorithms in P2P networks generate a significant amount of duplicate query messages to increase the success rate. We present a framework, named recursive partitioning search (RPS), for blind search over structured peer-to-peer (P2P) networks, by which the query message duplication can be avoided. Two realizations of the framework for Chord and Pastry are presented. With simulation model, we compare success rate, lookup delay and overlay network load of RPS and various well-known blind search algorithms, and show RPS is the superior blind search algorithm running over a DHT. The algorithm guarantees that with high probability the lookup delay to visit every peer is of O(log N) hops, comparable to the delay of the exact match search over the DHTs. With RPS, every node in the overlay network is visited not more than once by design. These characteristics qualify the recursive partitioning search over DHT as an efficient broadcasting algorithm. We investigate RPS scalability and propose the way to choose an appropriate time-to-live (TTL) parameter value to maintain the balance between high success rate and reasonable network load

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

[2]  Yan Chen,et al.  A Scalable Semantic Indexing Framework for Peer-to-Peer Information Retrieval , 2005, SIGIR 2005.

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

[4]  Henning Schulzrinne,et al.  Peer-to-peer internet telephony using SIP , 2005, NOSSDAV '05.

[5]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

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

[7]  Elizabeth R. Jessup,et al.  Matrices, Vector Spaces, and Information Retrieval , 1999, SIAM Rev..

[8]  C. Fellbaum.  An Electronic Lexical Database , 1998 .

[9]  Seif Haridi,et al.  Efficient Broadcast in Structured P2P Networks , 2003, IPTPS.

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

[11]  Christiane Fellbaum,et al.  Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[12]  T. Znati,et al.  A P2P overlay architecture for personalized resource discovery, access, and sharing over the Internet , 2005, Second IEEE Consumer Communications and Networking Conference, 2005. CCNC. 2005.

[13]  Eunsoo Shim.  An Architecture for Peer-to-Peer Session Initiation Protocol (P2P SIP) , 2006 .

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

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

[16]  Zhichen Xu,et al.  pSearch: information retrieval in structured overlays , 2003, CCRV.