DISTRIBUTED CYCLE MINIMIZATION PROTOCOL FOR PEER-TO-PEER NETWORKSBYJ.S.S.MALIKAK.VARALAKSHMIG.KIRANMAYIG.L.SWATHI

Introduction:

PEER-TO-PEER (P2P) technology is attracting a lot of

attention since it simplifies the implementation of large

ad hoc distributed repositories of digital information.

In a P2P system, numerous nodes are interconnected and

exchange data or services directly with each other.

There are two major categories of P2P architectures:

1) Hash based

2) Broadcast-based systems

We deal with the Broadcast based :

They use message flooding to propagate queries. There is no specific destination; hence, every neighbor peer is contacted and forwards the message to its own neighbors until the message’s lifetime expires. Such systems have been successfully deployed in practice to form worldwide ad hoc networks due to their simplicity and versatility. Here, we focus on broadcast based P2P architectures. Our methods are also applicable to two-layer networks based on super peers.

AbstractP2P area was triggered by the success of systems like Gnutella and Kazaa .

Gnutella is a pure flat P2P system that performs searching by Breadth-First Traversal (BFT) of the nodes around the initiator peerBroadcast-based peer-to-peer (P2P) networks

Kazaa is a two-layer super peer implementations.

These are extremely popular nowadays due to their simplicity, ease of deployment, and versatility. The unstructured network topology, however, contains many cyclic paths, which introduce numerous duplicate messages in the system.Thus resulting to bottleneck.

Problems in Existing system: contains many cyclic pathswhich results in numerous duplicate

messages in the system.They consume a large proportion of

the bandwidth and other resources.causing bottlenecks in the entire

network.

Proposed System: DCMP, a protocol for distributed cycle minimization in

broadcast-based P2P systems. DCMP preserves the low diameter of Gnutella-like networks while eliminating most of the duplicate messages. Moreover, the overhead due to control messages is minimal. This results in reduced response time, which, in turn, increases the scalability of the system.

Our protocol is suitable for dynamic networks since it handles peer joins/departures efficiently and is resilient to failures. DCMP is also designed to be as simple as possible . Therefore, it can be implemented on top of popular P2P systems such as Gnutella, Kazaa with minimal effort.

Advantages: we describe the Distributed Cycle Minimization Protocol

(DCMP) Which overcomes all the problems of the existing system.

It is a dynamic fully decentralized protocol that significantly reduces the duplicate messages by eliminating unnecessary cycles.

As queries are transmitted through the peers, DCMP identifies the problematic paths and attempts to break the cycles while maintaining the connectivity of the network.

In order to preserve the fault resilience and load balancing properties of unstructured P2P systems, DCMP avoids creating a hierarchical organization. Instead, it applies cycle elimination symmetrically around some powerful peers to keep

Operating Environment:

 Hardware Requirements Processor : Pentium III / IVHard Disk : 40 GBRam : 256 MBMonitor : 15VGA ColorMouse : Ball / OpticalKeyboard : 102 Keys

Software requirements:

 Operating System :

Windows XP professionalFront End : Microsoft

Visual Studio .Net 2005Language : Visual

C#.Net 

Modules:

ClientServerWorkgroup

 

Description; Server:

In this module first we have to login based on user id and password. After login we have browse the file. After getting the file we have to connect to workgroup. Whenever you are connected to workgroup it will display all the connected systems. after displaying all the ipAddress we have to select destination ip’s after selecting you have to send the information. Whenever sending then it will display the progress bar.

 Client:

In this modules first client give the proper login credentials after that they will enter into the client home page. Here it will display file details. If you want change the location of the file you can change here after wards you can save the file .

 Workgroup:

In this Module we have display the peer list which one is Active and which is inactive. By displaying Active System we send the message.

DIAGRAMS

Dataflow Diagram:login:

Open Login form

Enter User Name and Password

Check User

verification

Login Master

User Home Page

Server:

Open The form Select The File

Validaion

Enter The Client IP Address

Click On Send Button

Here It Will Display the Prograss

Usecase Diagram:Server:

Server

Login

ServerHomepage

Select The file

Connect The WorkGroup

Give The destination Ip Address

send The Message

Client:

Client

Login

ClientHomepage

View The file

Change The Location

Give The Folder Name

save The file Name

Sequence Diagram:

server login Bowse The fileWorkgroup Select The destination Ip Address send Message

1 : enteruid,pwd()

2 : Invalid()

3 : Here active peers will display()

4 : You can select The destinaton ipaddress()

5 : Browse The file()

6 : If Already exists the file()

7 : if not it will go to destination ipaddress()

Activity Diagrams:

Admin Activity:

Get the Data

Validate Data

[Enter Login Details]

Get the Data Get the Data

WorkGroup Sendata

Validate Data

no

yes

no

[submit]

[submit]

Validate Details

yesyes

no

General User Activity:

Get the Data

Validate Data

Get the Data Get the Data

Start Server Receive The File

Validate Data

no

yes

no

[submit]

[submit]

Validate Details

yesyes

no

OUTPUT SCREENS

Coclusion: we presented DCMP, a protocol for distributed cycle

minimization in broadcast-based P2P systems. DCMP preserves the low diameter of Gnutella-like networks whilen eliminating most of the duplicate messages. Moreover, the overhead due to control messages is minimal. This results in reduced

response time, increases the scalability of the system.

Our protocol is suitable for dynamic networks since it handles peer joins/departures efficiently and is resilient to failures. DCMP is also designed to be as simple as possible and is independent of the search algorithm. Therefore, it can be implemented on top of popular P2P systems such as Gnutella, Kazaa, or Gia with minimal effort.

THANK YOU

ANY QURIES??????

????