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
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 |
We proposed the LAN Dynamic Transmit Direction Search Algorithm - DTDS algorithm. We expounded the basic thought and the design principle of DTDS algorithm, carried on the theoretical analysis to such as aspects of its accuracy and parameter values. At last we took the simulation experiment, carried on the quantification analysis with the experimental datum to the algorithm, drew up the graph through using experimental datum, and presented the network search process through the image. We make the complex question to be clearer and direct-viewing. The simulation experiment verifies DTDS algorithm greatly improves the search speed while doesn't reduce the network coverage.