LSJ112.Peer to Peer File Sharing Program

5/24/2018 LSJ112.Peer to Peer File Sharing Program

1/4

Peer to Peer File Sharing Program

ABSTRACT

Peer-to-peer overlay networks are widely used in distributed systems.P2P networks can be

divided into two categories: structured peer-to-peer networks in which peers are connected by a

regular topology, and unstructured peer-to-peer networks in which the topology is arbitrary. The

objective of this work is to design a hybrid peer-to-peer system for distributed data sharing

which combines the advantages of both types of Peer-to-peer networks and minimies their

disadvantages. !onsistency maintenance is propagating the updates from a primary file to its

replica. "daptive consistency maintenance algorithm #"!$"% maintains that periodically polls

the file owner to update the file due to minimum number of replicas consistency overhead is very

low. Top !aching #T!% algorithm helps to boost the system performance and to build a fully

distributed cache for most popular information. &ur caching scheme can deliver lower 'uery

delay, better load balance and higher cache hit ratios. (t effectively relieves the over-caching

problems for the most popular objects.

Existing System

(n the past decade a number of prototype peer-to-peer information retrieval systems have been

developed. )nfortunately, none of these has seen widespread real-world adoption and thus, in

contrast with file sharing, information retrieval is still dominated by centralied solutions. (n this

article we provide an overview of the key challenges for peer-to-peer information retrieval and

the work done so far. *e want to stimulate and inspire further research to overcome these

challenges. This will open the door to the development and large-scale deployment of real-world

peer-topeer information retrieval systems that rival e+isting centralied client-server solutions in

terms of scalability, performance, user satisfaction, and freedom. The proposed hybrid peer-to-

peer system is composed of two parts: the first part is a structured core network which forms the

backbone of the hybrid system the second part is made of multiple unstructured peer-to-peer

networks each of which is attached to a node in the core network. The core structured networkcan narrow down the data lookup within a certain unstructured network accurately, while the

unstructured networks provide a low-cost mechanism for peers to join or leave the system freely.

Proposed System


2/4


we propose a hybrid peer-to-peer system for distributed data sharing which combines the

structured and unstructured peer-to-peer networks. (n the proposed hybrid system, a structured

ring-based core network forms the backbone of the system and multiple unstructured peer to peer

networks are attached to the backbone and communicate with each other through the backbone.

The core-structured network provides an accurate way to narrow down the 'ueried data within a

certain unstructured network, while the unstructured networks provide a low cost mechanism for

peers to join or leave the system freely. The main contributions of this paper can be summaried

as follows: Propose a hybrid peer-to-peer system for distributed data sharing. (t utilies both the

efficiency of the structured peer- to- peer network and the fle+ibility of the unstructured peer -

to- peer network, and achieves a good balance between the efficiency and fle+ibility. To

maintain consistency, using file consistency algorithm for hybrid P2P system so that periodically

the file owner to update the file due to number of replicas consistency overhead is very low.

To boost the performance of hybrid P2P, Top !aching #T!% algorithm is used to build a fully

distributed cache for popular information in P2P systems. (t effectively relieves the over caching

problems for the most popular objects.

IMPLEMENTATION

(mplementation is the stage of the project when the theoretical design is turned out into a

working system. Thus it can be considered to be the most critical stage in achieving a successful

new system and in giving the user, confidence that the new system will work and be effective.

The implementation stage involves careful planning, investigation of the e+isting system and it/s

constraints on implementation, designing of methods to achieve changeover and evaluation of

changeover methods.

Main Modules:

"lgorithm used "daptive consistency maintenance algorithm


3/4


#"!$"%

Modules:

!" Core Transit Net#or$:

The core transit network, called t-network, is a structured peer-to-peer network, which organies

peers into a ring. *e call peers in thet network t-peers. 0ach t-peer is assigned a peer (1. 0ach t-

peer maintains two pointers, which point to its successor and predecessor, respectively.

%" Stu& Net#or$:

" stub network, called s-network, is a nutella-style unstructured peer-to-peer network. The

topology of an s-network is arbitrarily formed. 0ach s-network is attached to a t-peer and this t-

peer belongs to both the tnetwork and the s-network. &ne thing to mention about the s-network

is that the topology of an s-network is a tree instead of a mesh.

'" Idea o( )y&rid Peer:

The basic idea behind the hybrid peer-to-peer system is that the tnetwork is used to provide

efficient and accurate service while the s-network is used to provide appro+imate best-effort

service to accommodate fle+ibility. Peers can join either t-network or s-network directly. The

hybrid system can effectively reduce the topology maintenance overhead caused by peer joining

or leaving.

*" Consisten+y Algorit,m:

(n the distributed data sharing, the consistency of the data needs to be focused because there are

two different networks are built on single. $aintaining consistency between fre'uently updated

or even infre'uently updated files and their replicas is a fundamental reliability re'uirement for a

P2P system. P2P systems are characteried by dynamism, in which node join and leave

continuously and rapidly. $oreover, replica nodes are dynamically and continuously created and

deleted. 3or consistency maintenance, we introduce an algorithm for hybrid network, which is

known as "daptive 3ile !onsistency "lgorithm #"3!"%.

System Re-uirement Spe+i(i+ation:

)ard#are Re-uirements:


4/4


Processor - Pentium 4(((

peed - 5.5 6

7"$ - 289 $ #min%

6ard 1isk - 2;

3loppy 1rive - 5."

So(t#are Re-uirements:

&perating ystem: *indows?8@?A@2;;;@BP

3ront 0nd: java, jdk5.9

Documents

LSJ112.Peer to Peer File Sharing Program