Peer-to-Peer Computing, IEEE International Conference on (2006)
Cambridge, United Kingdom
Sept. 6, 2006 to June 8, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2006.34
Vladimir Vishnevsky , Russian Academy of Science, Russia
Alexander Safonov , Russian Academy of Science, Russia
Mikhail Yakimov , Russian Academy of Science, Russia
Eunsoo Shim , Panasonic Princeton Laboratory, USA
Alexander D. Gelman , Panasonic Princeton Laboratory, USA
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.
M. Yakimov, A. D. Gelman, V. Vishnevsky, E. Shim and A. Safonov, "Scalable Blind Search and Broadcasting in Peer-to-Peer Networks," 2006 6th IEEE International Conference on Peer-to-Peer Computing(P2P), Cambridge, 2006, pp. 259-266.