Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks

In unstructured peer-to-peer networks, each node does not have global information about the whole topology and the location of other nodes. A dynamic property of unstructured P2P networks, capturing global behavior is also difficult. Search algorithms to locate the queried resources and to route the message to the target node. Flooding and RW are two typical examples of blind search algorithms by which query messages are sent to neighbors without any knowledge about the possible locations of the queried resources or any preference for the directions to send. Both algorithms are not suitable to route a message to target. The proposed algorithm is dynamic search (DS), which is a generalization of flooding and RW. Dynamic Search uses knowledge-based search mechanisms. Each node could relay query messages more intelligently to reach the target node.

Existing System:
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Search algorithms to locate the queried resources and to route the message to the target node.

• Flooding and random walk (RW) are two typical search algorithms. • Flooding searches aggressively and covers the most nodes. Flooding belongs to
Best First Search algorithm. It generates a large amount of query messages but would take short term search.

• RW searches conservatively. RW belongs to Depth First Search algorithm. It only
generates a fixed amount of query messages at each hop but would take longer search time.

• Numerical results show that DS provides a good tradeoff between search performance and cost. query efficiency. query messages. DS performs about 186 times better than flooding and 120 times better than RW in bimodal topologies DS reduces search cost. the coverage of RW grows linearly with hop counts. Proposed System: • We propose the dynamic search (DS) algorithm.Disadvantage • Flooding is the search cost and not scale. which is a generalization of flooding and RW. • Performance of DS based on some performance metrics including the success rate. search time. • RW only visits one node for each hop. query hits. Advantage: • • • DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs. time and improves performance. • It resembles flooding for short-term search and RW for long-term search. • DS could be further combined with knowledge-based search mechanisms to improve the search performance. and search efficiency. which is slow. • It produces a query messages even when the resource distribution is scarce. .

6 GHz 512 MB DD RAM 15” color 20 GB Software: • • • • Front End Back End Tools Used : : : Java.System Requirements Hardware: • • • • Processor RAM Monitor Hard Disk : : : : Pentium IV 2. Swing MS Access NetBeans IDE 6.1 Windows XP Operating System : .

Sign up to vote on this title
UsefulNot useful