P. 1


|Views: 0|Likes:
Published by Suresh Mp

More info:

Published by: Suresh Mp on Dec 19, 2012
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less





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.

search time. query messages. and search efficiency.Disadvantage • Flooding is the search cost and not scale. • It resembles flooding for short-term search and RW for long-term search. . which is a generalization of flooding and RW. Advantage: • • • DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs. query efficiency. • It produces a query messages even when the resource distribution is scarce. query hits. which is slow. • Performance of DS based on some performance metrics including the success rate. • RW only visits one node for each hop. • Numerical results show that DS provides a good tradeoff between search performance and cost. • DS could be further combined with knowledge-based search mechanisms to improve the search performance. 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. time and improves performance.

Swing MS Access NetBeans IDE 6.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.1 Windows XP Operating System : .

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->