Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
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
Analysis models for unguided search in unstructured P2P networks
International Journal of Ad Hoc and Ubiquitous Computing
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Evaluation of models for analyzing unguided search in unstructured networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
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
Performance Analysis and Improvement Content Discovery Protocols Over Vehicular Networks
Wireless Personal Communications: An International Journal
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random graph based P2P networks. We then present two analytical models: the algebraic model and the combinatorial model. These models are useful in setting query parameters and evaluating search efficiency. We evaluate these two models in terms of various performance metrics against simulation results. We also study the impact of the setup parameters, such as node degree, hop count, and number of walkers, on the query performance, and on the precision of the models.