DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER TO PEER NETWORK

DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER TO PEER NETWORK

ABSTRACT

            Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages at each hop but would take longer search time.

            We propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW. DS takes advantage of various contexts under which each previous search algorithm performs well.

            It resembles flooding for short-term search and RW for long-term search. Moreover, DS could be further combined with knowledge-based search mechanisms to improve the search performance. Numerical results show that DS provides a good tradeoff between search performance and cost. DS performs better than flooding and better than RW.

HARDWARE SPECIFICATION

                      All the hard physical materials used in any system are called hardware. These are the devices, which are made to perform specific functions and can do only that works as instructed. They can be both electronic devices and mechanical systems.

Processor                     :           Pentium III/IV

Hard disk                     :           40 GB

Ram                             :           256 MB

Monitor                        :           15 VGA Color

Mouse                          :           Ball/Optical

Keyboard                     :           102 Keys

SOFTWARE SPECIFICATION

                        Software is a set of instructions that are used to command any system to perform any operation. Software has the advantage to make decisions to deliver sensible results and is useful in handling complex situations.

Operating Systems                   :           Windows XP Professional

                        Platform                                   :           Java

                        Back End                                 :           SQL Server 2000

EXISTING SYSTEM

            In Existing system they Use Flooding and Random Walk (RW)     search algorithms.

Search algorithms in previous work based on two types

·         Breadth First Search

·         Depth First Search

Flooding: (BFS)

It sends the query messages to all of its neighbors, except for the one the query messages come from.

Random Walk: (DFS)

Only generates fixed amount of query messages at each hop.(i.e.) the query source just sends one query message (walker) to one of its neighbors.

 DRAWBACKS

            Flooding

·         The drawback of flooding is the search cost.

                       

·         Search is especially inefficient when the target is far from the query source because the number of query messages would grow exponentially with the hop counts.

Random Walk

·         It takes the long search time.

PROPOSED SYSTEM

            In this we propose the Dynamic Search algorithm. This is a generalization of flooding and RW.

DS overcomes the disadvantages of flooding and RW, and takes advantage of various contexts under which each search algorithm performs well.

DS is designed to perform aggressively for the short-term search and conservatively for the long-term search.

 ADVANTAGES

·         Numerical results show that DS could provide a good result in search performance and cost.

·         DS can obtain short search time and provide a good tradeoff between the search    performance and cost.