The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Probabilistic scalable P2P resource location services
ACM SIGMETRICS Performance Evaluation Review
Challenges in Implementing a Context-Aware System
IEEE Pervasive Computing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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)
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Ad Hoc, self-supervising peer-to-peer search networks
ACM Transactions on Information Systems (TOIS)
Hybrid global-local indexing for effcient peer-to-peer information retrieval
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Context management for the provision of adaptive services to roaming users
IEEE Wireless Communications
Hi-index | 0.01 |
In relation to decentralized search on top of P2P communication paradigm, we study a proactive mechanism that is based on the dissemination of advertisements for new sources that join a system. The system design goal of limiting the state maintained by each peer and ensuring search efficiency is the driving reason for exploiting the small-world idea, and in particular the hierarchical network model, which provides theoretical bounds on search time. Starting from the study of this theoretical model, we try to reflect it into protocol design. Simulation results testify to the theoretical bounds on search time and provide a quantification view on the search time in relation to the directory capacity requirements of the peers.