Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tag Routing for Efficient Blind Search in Peer-to-Peer Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Analytical Study on Improving DHT Lookup Performance under Churn
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Management of peer-to-peer overlays
International Journal of Internet Protocol Technology
Optimally efficient multicast in structured peer-to-peer networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
PISA: A framework for integrating uncooperative peers into P2P-based federated search
Computer Communications
PonD: dynamic creation of HTC pool on demand using a decentralized resource discovery system
Proceedings of the 21st international symposium on High-Performance Parallel and Distributed Computing
Future Generation Computer Systems
| Hi-index | 0.24 |
Typical blind search algorithms in P2P networks generate a significant amount of duplicate query messages in order to increase the success rate. We present a novel 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. By simulation, we compare success rate, lookup delay and overlay network load of RPS with various well-known blind search algorithms, and illustrate RPS being a superior blind search algorithm running over DHTs. The algorithm guarantees that with high probability the lookup delay to visit every peer is of O(logN) hops, comparable to the delay of the exact-match search over the DHTs, which is proved for two example DHTs, Chord and Pastry in the paper. RPS is a simple and intuitive method for blind search over DHTs compared to other complex approaches like those building sophisticated index structures or requiring analysis of the words in the stored documents, yet a lot more efficient than known simple methods like Flooding and Random Walk. 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 a formula to choose an appropriate Time-to-Live (TTL) parameter value to maintain the balance between high success rate and reasonable network load. Active peer churn degrades the performance of RPS as a broadcasting mechanism proportionally to the churn rate. But the success rate of blind search using RPS may be affected negligibly if proper replications exist as in most P2P file sharing networks.