A random graph model for massive graphs
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
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
IEEE Internet Computing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Improving Search in Peer-to-Peer Networks
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
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Multimedia Systems
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
Optimal Controlled Flooding Search in a Large Wireless Network
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Characterizing the two-tier gnutella topology
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Flood search under the California Split rule
Operations Research Letters
Zone indexing: Optimizing the balance between searching and indexing in a loosely structured overlay
Computer Networks: The International Journal of Computer and Telecommunications Networking
Expansion and search in networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
An efficient resource discovery framework for pure unstructured peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Efficient search algorithms are crucial to the success of unstructured and hybrid peer-to-peer networks. Performance requirements on search algorithms include low search traffic, low search latency, and determinism in returning the searched items. However, existing search algorithms fail to meet these goals. We propose, analyze, and evaluate two novel flooding search algorithms. The first algorithm conducts on-the-fly estimation of the popularity of the searched item, and uses such knowledge to guide a peer's search process. It requires the minimum search cost and very low latency, and albeit its non-determinism, often returns the desired number of results. The second algorithm, Hurricane flooding, exponentially expands the search horizon of the source of a search in a spiral pattern. Hurricane flooding is deterministic, requires search cost arbitrarily close to a lower bound, and returns the results in logarithmic time. We analyze and optimize our proposed algorithms, and evaluate them using various network models, including a real Gnutella network topology.