Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
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
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Analysis Models for Blind Search in Unstructured Overlays
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
On constructing internet-scale p2p information retrieval systems
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Analysis models for unguided search in unstructured P2P networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Evaluating the efficiency of unguided search based on random walk in unstructured peer-to-peer networks is important because it provides guidelines in correctly setting the parameters of the search. Most existing work is based on simulations. We evaluate two analytical models – the algebraic model and the combinatorial model – for various search efficiency metrics against simulation results. We use the random graph topology and assume unguided searches. The results show that the two analytical models are accurate and match each other closely. We study the impact of the average node degree, hop count, number of walkers, and replication ratios on node coverage, object recall, and message efficiency, and on the accuracy of the models.