Adaptive Probabilistic Algorithm for Peer Networks

Provided by: International Journal of Innovative Research in Science, Engineering and Technology (IJIRSET)
Topic: Networking
Format: PDF
In unstructured peer-to-peer networks, every node doesn't have world data regarding the entire topology and also the location of different nodes. Search algorithms to find the queried resources and to route the message to the target node. Flooding and RW square measure 2 blind search algorithms by that question messages square measure sent to neighbors with none information regarding the potential locations of the queried resources. Both algorithms are not suitable to route a message to target in effective manner. The proposed algorithm is Dynamic Search (DS), which is a generalization of flooding and RW.

Find By Topic