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
Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Novel Efficient Search Algorithm in Unstructured P2P Networks
DMAMH '07 Proceedings of the Second Workshop on Digital Media and its Application in Museum & Heritage
Restricted Path Flooding Scheme in Distributed P2P Overlay Networks
ICISS '08 Proceedings of the 2008 International Conference on Information Science and Security
Enabling selective flooding to reduce P2P traffic
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Hi-index | 0.00 |
In view of the problem of slow search speed conduced by failure Topology and limited retransmission nodes quantity in MDBS search algorithm; we proposed the LAN Agent-Based Direction Search algorithm-ABDS algorithm. We expounded the basic thought and design principle of ABDS algorithm and carried on the theoretical analysis to such as aspects of its accuracy and parameter values. The analysis results show that ABDS algorithm greatly improves the search speed while doesn't reduce the network coverage.