On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems
IEEE Transactions on Parallel and Distributed Systems
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Searching in unstructured peer-to-peer network with scalability and effectiveness is still a challenging problem. Recently in many applications, one-hop index replication becomes a fundamental technique for improving the search performance. However, when we extend one-hop index replication to multiple hops for locating both popular contents and rare objects with high lookup success rate, index storage cost and index data transfer overload become serious obstacles. In this paper, we propose a novel technique to exploit the advantage of multi-hop index replication and significantly reduce the cost of index storage. Our approach is to separate the peers and contents into groups and associating the nodes with shared files in group space. Each node works as a delegate node to storing the same group file indices which come from its neighbors. Search process is restricted in a group of peers according to the query's hash value. We study the search performance and index storage cost of random walk with group-based index replication (GBIR) through theoretical model and give the mathematical relationship between GBIR and random walk with normal index replication (IR). We further evaluate the GBIR technique by simulator-based experiments, and the results show that GBIR can achieve the similar lookup success rate to IR and reduce the index storage cost to only 1/g of IR's (g is the number of groups in the system). Finally, we significantly improve the GBIR's search performance using GBIR with the highest degree neighbor routing (GBIR+).