The Community for Technology Leaders
Peer-to-Peer Computing, IEEE International Conference on (2005)
Konstanz, Germany
Aug. 31, 2005 to Sept. 2, 2005
ISBN: 0-7695-2376-5
pp: 165-172
Ananth Grama , Purdue University
Ronaldo A. Ferreira , Purdue University
Murali Krishna Ramanathan , Purdue University
Suresh Jagannathan , Purdue University
Asad Awan , Purdue University
Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts, efficient algorithms for guaranteed location of shared content in unstructured P2P networks are yet to be devised. In this paper, we present a simple but highly effective protocol for object location that gives probabilistic guarantees of finding even rare objects independently of the network topology. The protocol relies on randomized techniques for replication of objects (or their references) and for query propagation. We prove analytically, and demonstrate experimentally, that our scheme provides high probabilistic guarantees of success, while incurring minimal overhead. We quantify the performance of our scheme in terms of network messages, probability of success, and response time. We also evaluate the robustness of our protocol in the presence of node failures (departures). Using simulation, we show that our scheme performs no worse than the best known access-frequency based protocols, without compromising access to rare objects.
Ananth Grama, Ronaldo A. Ferreira, Murali Krishna Ramanathan, Suresh Jagannathan, Asad Awan, "Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks", Peer-to-Peer Computing, IEEE International Conference on, vol. 00, no. , pp. 165-172, 2005, doi:10.1109/P2P.2005.33
102 ms
(Ver 3.3 (11022016))