The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Adaptive Retrieval Agents: Internalizing Local Contextand Scaling up to the Web
Machine Learning - Special issue on information retrieval
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
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
IEEE Internet Computing
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)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Emerging small-world referral networks in evolutionary labormarkets
IEEE Transactions on Evolutionary Computation
Cost-effective broadcast for fully decentralized peer-to-peer networks
Computer Communications
| Hi-index | 0.00 |
One of the main technical challenges in Peer-to-Peer (P2P) networks is how to efficiently locate desired resources. Although structured systems, based on distributed hash tables, can achieve fair effectiveness, they are not suitable for widely deployed Internet applications. In fact, this kind of systems shows many severe limitations, such as ignoring the autonomous nature of peers, and supporting only weakly semantic functions. Unstructured P2P networks are more attractive for real applications, since they can avoid both the limitations of centralized systems, and the drawbacks of structured approaches. However, their search algorithms are usually based on inefficient flooding schemes, that make large systems quickly overwhelmed by the query-induced load. In order to address this major limitation, this paper proposes a local adaptive routing protocol for searching in unstructured systems. The approach exploits a smart neighbor selection process that significantly improves resource discovery. Furthermore, this mechanism facilitates the dynamic evolution of a P2P system based on an unstructured topology, grouping together nodes with similar interests, thus allowing the emerging of small world topologies. Extensive simulations show that the algorithm proposed scales well and has a very good impact on the successful rate, allowing to retrieve the resources searched even when they are sparse.