DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS--PARALLEL AND DISTRIBU
#1

DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS--PARALLEL AND DISTRIBUTED SYSTEMS

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. We analyze the 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. On average, DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs, and about 186 times better than flooding and 120 times better than RW in bimodal topologies.

Technology to use:JAVA
Reply
#2
in this project what is the result analysis.
Reply
#3
Hi Some one could send me some detailed documentation of the paper
Reply
#4
[attachment=13539]
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
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. We analyze the 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. On average, DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs, and about 186 times better than flooding and 120 times better than RW in bimodal topologies.
Objective:
In this paper, we propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW. DS overcomes the disadvantages of flooding and RW and takes advantage of different contexts under which each search algorithm performs well. The operation of DS resembles flooding for the short-term search and RW for the long-term search.
Existing System:
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. Some other blind search algorithms include modified BFS (MBFS) , directed BFS expanding ring and random periodical flooding (RPF).These algorithms try to modify the operation of flooding to improve the efficiency. However, they still generate a large amount of query messages.
DISADVANTAGES:
In the existing system search cost is high.
It produces considerable query messages even when the resource distribution is scarce.
The 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.
It’s more time consuming one.
Proposed System:
In this paper, we propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW. DS overcomes the disadvantages of flooding and RW and takes advantage of different contexts under which each search algorithm performs well. The operation of DS resembles flooding for the short-term search and RW for the long-term search. In order to analyze the performance of DS, we apply the random graphs as the models of network topologies and adopt the probability generating functions to model the page link degree distribution. We evaluate the performance of search algorithms in accordance with some performance metrics including the success rate, search time, number of query hits, and number of query messages, query efficiency, and search efficiency.
ADVANTAGES:
It reduces a search time.
It takes advantages of Flooding based and random walk technique.
Knowledge-based search algorithms take advantage of the knowledge learned from previous search results and route query messages with different weights based on the knowledge.
System Requirements:
Hardware requirements:

Processor : Any Processor above 500 MHz.
Ram : 128Mb.
Hard Disk : 10 Gb.
Compact Disk : 650 Mb.
Input device : Standard Keyboard and Mouse.
Output device : VGA and High Resolution Monitor.
Software requirements:
Operating System : Windows Family.
Language : JDK 1.5
Data Bases : Microsoft Sql Server
Front End : Java Swing
PROBLEM DEFINATION:
IN unstructured peer-to-peer (P2P) networks, each node does not have global information about the whole topology and the location of queried resources. Because of the dynamic property of unstructured P2P networks, correctly capturing global behavior is also difficult . Search algorithms provide the capabilities to locate the queried resources and to route the message to the target node. Thus, the efficiency of search algorithms is critical to the performance of unstructured P2P networks.
Previous works about search algorithms in unstructured P2P networks can be classified into two categories: breadth first search (BFS)-based methods, and depth first search (DFS)-based methods. These two types of search algorithms tend to be inefficient, either generating too much load on the system, or not meeting users’ requirements. Flooding, which belongs to BFS-based methods, is the default search algorithm for Gnutella network. By this method, the query source sends its query messages to all of its neighbors. When a node receives a query message, it first checks if it has the queried resource. If yes, it sends a response back to the query source to indicate a query hit. Otherwise, it sends the query messages to all of its neighbors, except for the one the query message comes from. The drawback of flooding is the search cost. It produces considerable query messages even when the resource distribution is scarce. The 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. Fig. 1 illustrates the operation of flooding. The page link degree of each vertex in this graph is 4. If the network grows unlimited from the query source, the number of query messages generated by flooding at each hop would be 4, 12, 36, . . . , respectively. If the queried resource locates at one of the third neighbors, it takes 4, 12, 36, 52 query messages to get just one query hit.
On the other hand, random walk (RW) is a conservative search algorithm, which belongs to DFS-based methods. By RW, the query source just sends one query message (walker) to one of its neighbors. If this neighbor does not own the queried resource, it keeps on sending the walker to one of its neighbors, except for the one the query message comes from, and thus, the search cost is reduced. The main drawback of RW is the long search time. Since RW only visits one node for each hop, the coverage of RW grows linearly with hop counts, which is slow compared with the exponential growth of the coverage of flooding. Moreover, the success rate of each query by RW is also low due to the same coverage issue. Increasing the number of walkers might help improve the search time and success rate, but the effect is limited due to the page link degree and redundant path.
Reply
#5
Hello sir can any one send the detailed code and documentation for the project
Sir i'm very thankful if any body provides the details
my mail id mahesh.tp49[at]gmail.com[/color]
Reply
#6
i need data base query fo this project
Reply
#7
to get information about the topic DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS full report ppt and related topic refer the page link bellow

http://studentbank.in/report-dynamic-sea...d-distribu

http://studentbank.in/report-dynamic-sea...r-networks

http://studentbank.in/report-dynamic-sea...rks--14433
Reply
#8
steps for dynamic search algorithm for dynamics of malwate spread in decentralized peer to peer networks
Reply
#9
Hello sir can any one send the detailed code and documentation for the project
Sir i'm very thankful if any body provides the details
my mail id
sorayadaniali[at]gmail.com
Reply
#10

To get full information or details of DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS--PARALLEL AND DISTRIBU please have a look on the pages

http://studentbank.in/report-dynamic-sea...d-distribu

if you again feel trouble on DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS--PARALLEL AND DISTRIBU please reply in that page and ask specific fields in DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS--PARALLEL AND DISTRIBU
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: ppt parallel computing technology based mobile search engine, what type of algorithms are used in a distributed protocol to serve dynamic groups for peer to peer streaming, unstructureed, report for dynamic search algorithm in unstructured peer to peer networks pdf, asimo atvanteges and disadvantegesin unstructured peer to peer networks ppt, bloomcast algorithm in unstructured peer to peer networks, dynamic search algorithm in unstructured peer to peer networks,

[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks seminar class 4 3,542 17-10-2017, 02:48 PM
Last Post: jaseela123d
  Privacy- and Integrity-Preserving Range Queries in Sensor Networks 1 849 15-02-2017, 04:10 PM
Last Post: jaseela123d
  Service-Oriented Architecture for Weaponry and Battle Command and Control Systems in 1 1,045 15-02-2017, 03:40 PM
Last Post: jaseela123d
  Protecting Location Privacy in Sensor Networks Against a Global Eavesdropper 1 780 15-02-2017, 11:01 AM
Last Post: jaseela123d
  Protecting Location Privacy in Sensor Networks Against a Global Eavesdropper 1 742 15-02-2017, 11:00 AM
Last Post: jaseela123d
  An Efficient Algorithm for Mining Frequent Patterns full report project topics 3 4,714 01-10-2016, 10:02 AM
Last Post: Guest
  watermarking algorithm seminar class 3 2,663 27-04-2016, 11:17 AM
Last Post: dhanabhagya
  projects on computer networks? shakir_ali 2 1,575 25-01-2016, 02:26 PM
Last Post: seminar report asees
  Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks Projects9 2 1,301 14-07-2015, 02:11 PM
Last Post: seminar report asees
  TEA ENCRYPTION (ALGORITHM) computer science technology 1 2,647 11-11-2014, 10:45 AM
Last Post: Guest

Forum Jump: