Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
BloomCast: Efficient Full-Text Retrieval over Unstructured P2Ps with Guaranteed Recall
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Random walk with jumps in large-scale random geometric graphs
Computer Communications
Improving the performance of P2P networks using SPIS with Query Filtering
Journal of High Speed Networks
| Hi-index | 0.00 |
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in P2P resource sharing environments is efficient searching algorithm. This is especially important for Gnutella-like decentralized and unstructured networks since they have power-law degree distributions. A robust search algorithm should respond to the query message promptly without generating redundant query messages. We present unified quantitative search performance measurements: Query Efficiency, Search Responsiveness,and Search Efficiency to objectively capture dynamic behaviors of various search algorithms from different perspectives. To gain insight of these search algorithms, we quantitatively characterize, through simulations, their search performance on different network topologies with different query/replication distributions.