Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks

Dynamic Search Algorithm in Unstructured

Peer-to-Peer Networks

Abstract:

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.

Click Here to Download this Project

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.

Disadvantage

• Flooding is the search cost and not scale.
• It produces a query messages even when the resource distribution is scarce.
• RW only visits one node for each hop, the coverage of RW grows linearly with hop counts, which is slow.

Proposed System:

• We propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW.
• 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.
• Performance of DS based on some performance metrics including the success rate, search time, query hits, query messages, query efficiency, and search efficiency.
• Numerical results show that DS provides a good tradeoff between search performance and cost.

 Advantage:

• DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs.
• DS performs about 186 times better than flooding and 120 times better than RW in bimodal topologies
• DS reduces search cost, time and improves performance.

Modules and Description

Modules

·         Peer Request

In this module A System has to ask the connection to the superpeer, the peer system has to make a connection with any one superpeer for a communication.

·         Super peer Response

In this module the superpeer has to send the response to the particular peer according to the capacity and request.

·         Upload

In this module, the peer sends it ip/port number corresponding to their file information.

·         Super peer updating

In this module, the superpeer maintains its database and peer request too. So database updating and maintenance is important. If any peer /superpeer ask file means it has to check with its database, if not found means it has to ask its neighboring superpeers until get the files.

·         File request

In this module, the peer asks the (word document file) to the main server i.e(Superpeer). The superpeer check the particular information file in the superpeer database if found send their port number.

·         Updating probability table

In this module, superpeer updates the probability table by using Dynamic Search Algorithm. If a search query for some file delivers to a certain peer successfully, the probability value corresponding to that peer is increased. If the search fails finally, it will decrease the probability value.

·         Response

In this module, peer will get the IP/Port address corresponding to that the file information. The peer will communicate with that ip/port no. for future.

System Requirements

Hardware:

·         PROCESSOR        :          PENTIUM IV 2.6 GHz

·         RAM                                  :          512 MB DD RAM

·         MONITOR                        :          15” COLOR

·         HARD DISK                     :          20 GB

·         FLOPPY DRIVE              :          1.44 MB

·         CDDRIVE                         :          LG 52X

·         KEYBOARD                    :          STANDARD 102 KEYS

·         MOUSE                             :          3 BUTTONS

Software:

·         Front End               :          Java, Swing

·         Back End               :          MS Access

·         Tools Used             :          NetBeans  IDE 6.1

·         Operating System   :         Windows XP

Click Here to Download this Project