Model for structuring unstructured peer to peer network for file

searching

Under The Guidance Of –Dr. Vijay Kumar Chaurasia

Submitted By – Dipu Kumar (RIT2012015) Kailash Patel(RIT2012053)

Naval Kishor Meena(RIT2012049)

Nawalesh Kumar Kunwar(RIT2012051)

Shailesh Kumar Diwakar(RIT2012040)

Tarang Bharti(RIT20120017)

CONTENTS

1. Abstract2. Introduction3.Objective4. Structuring an unstructured peer to peer Network using MST 5. Proposed Methodology(file searching algorithm)6. Limitatations

ABSTRACTDesigning efficient search algorithms is a key challenge in unstructured peer-to-peer networks. And we have structured the unstructured network model using minimal spanning tree (Prim’s Algorithm) and characteristic search algorithms (Breadth First Search Algorithm) for file searching in structured network. In unstructured peer-to-peer networks, each node does not have global information about the whole topology and the location of other nodes. We are using search algorithms to locate the queried resources and to route the message to the target node. BFS is typical examples of 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.    

INTRODUCTIONP2P Is An Approach To Computer Networking Where All Computers Share Equivalent Responsibility For Processing Data. Peer-to-peer Networking Differs From Client-server Networking, Where Certain Devices Have Responsibility For Providing Or "Serving" Data And Other Devices Consume Or Otherwise Act As "Clients" Of Those Servers. Here Peer Is Defined As A Computer That Has Both Client And Server Roles. In Such Networks, There Is No Central Server Managing The Network, Neither Is There A Central Router. Some Examples Of Pure P2P Application Layer Networks Designed For File Sharing Are Gnutella.

CONTINUED….

UNSTRUCTURED P2PNETWORK Has structure, but peers are free to join anywhere and objects can be stored anywhere. An unstructured P2P network is formed when the overlay links are established arbitrarily. Such networks can be easily constructed as A new peer that wants to join the network can copy existing links of another node and then form its own links over time. In an unstructured P2P network, if A peer wants to find A desired piece of data in the network, the query has to be flooded through the network to find as many peers as possible that share the data.

STRUCTURED P2P NETWORK  In structure peer to peer networks the entire network is based on certain pre-defined rules. Structured p2p networks generally holds the traits of using some type of algorithm for organization or optimization of the network. Structured p2p networks use some type of global protocol to ensure that any node in the network can proficiently route a search to some peer that has a desired file.

•  

CONTINUED..... DISADVANTAGES OF UNSTRUCTURED P2P NETWORK :

The main disadvantage with such networks is that the queries may not always be resolved. Popular content is likely to be available at several peers and any peer searching for it is likely to find the same thing. But if A peer is looking for rare data shared by only A few other peers, then it is highly unlikely that search will be successful. Since there is no correlation between A peer and the content managed by it, there is no guarantee that BFS will find A peer that has the desired data. BFS also causes A high amount of signaling traffic in the network and hence such networks typically have very poor search efficiency. Most of the popular P2P networks are unstructured. Examples for such networks are for example Gnutella.

  

OBJECTIVEWe aim to structure an structured peer to peer network and suggest A routing method that would balance the load of the system.

STRUCTURING AN UNSTRUCTURED PEER TO PEER NETWORKMinimum Spanning Tree (Prim’s Algorithm) For Structuring The Network:We have used the minimum spanning tree using prim’s algorithm to structure the unstructured p2p network. For given undirected weighted graph which is in form of unstructured network, we built the topology of all the given nodes and then converted the graph into the MST (minimum spanning tree) for efficient searching further. Now we will take root node as the super nodes that will contain the information about the neighbor nodes and communicates these nodes. There are files which we want to search and these files are the physical files. When we structure the unstructured network, searching of files in it becomes easy.

PLOT OF GRAPH AND MST

PROPOSED METHODOLOGYFILE SEARCHING ALGORITHM (BREADTH FIRST SEARCH):

We have use breadth first search algorithm for file searching in structured peer-to-peer network. Breadth first search is A graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. BFS is an uninformed search method that aims to expand and examine all nodes of A graph or combination of sequences by systematically searching through every solution. In other words, it exhaustively searches the entire graph or sequence without considering the goal until it finds it.

From the standpoint of the algorithm, all child nodes obtained by expanding A node are added to A FIFO (first in first out) queue. In typical implementations, nodes that have not yet been examined for their neighbors are placed in some container (such as A queue) called "open" and then once examined are placed in the container "closed".

MODULESPeer File Request

UPLOAD FILE

RESPONSE

LIMITATIONS

• Security is A major concern as not all shared files are from beginning sources.

• Attackers may add malware to p2p files as an attempt to take control of other nodes in the network.

• Scalability problem arises when multiple requests arise at a single time.

• Servers need heavy processing power.• Another disadvantage is the bandwidth usage required. This may lead to limit peer-to-peer traffic.