A Tree Based Peer to Peer Network with Quality Gurantee

[shruthy]

A Tree Based Peer to Peer Network with Quality Gurantee

Introduction
Peer-to-peer (P2P) networks often demand scalability, low communication latency among nodes, and low system wide overhead. For scalability, a node maintains partial states of a P2P network and connects to a few nodes. For fast communication, a P2P network intends to reduce the communication latency between any two nodes as much as possible. With regard to a low system wide overhead, a P2P network minimizes its traffic in maintaining its performance efficiency and functional correctness. In this paper, we present a novel tree-based P2P network with low communication delay and low system wide overhead. The merits of our tree-based network include:
1) A tree-shaped P2P network, which guarantees that the degree of a node is constant in probability, regardless of the system size (the network diameter in our tree-based network increases logarithmically with an increase in the system size, and in particular, given a physical network with a power-law latency expansion property, we show that the diameter of our tree network is constant),
2) Provable performance guarantees. We evaluate our proposal by a rigorous performance analysis, and we validate this by extensive simulations.

About the Project
We have three sections in this project where first part consists of the how to design a network and also how to maintain the same network when it leads to some problem like node is de active. In the first part of the project, we use two algorithm named Network Construction and Network Maintenance which operates the whole network by adding the host to the network and also if the host is de active the tree diameter is maintained same when any action such as adding and removing of the host in the network.
In the second part of the project consist of the how to send the message from one host to another host which is under the maintains of tree by using the process of Socket Connection.

Existing System
In peer-to-peer networks all nodes are act as server as well as client therefore no need of dedicated server.
An important goal in peer-to-peer networks is that all clients provide resources, including bandwidth, storage space, and computing power.
It is not a Server Based Application (Decentralized Network)
Limitations of Existing System
As nodes arrive and demand on the system increases, the total capacity of the system also increases.
The distributed nature of peer-to-peer networks also increases robustness in case of failures by replicating data over multiple peers, and -- in pure P2P systems -- by enabling peers to find the data without relying on a centralized index server.
The system is not centralized, making administration difficult.
Lack of security.
Proposed System
1) A tree-shaped P2P network, which guarantees that the degree of a node is constant in probability, regardless of the system size (the network diameter in our tree-based network increases logarithmically with an increase in the system size, and in particular, given a physical network with a power-law latency expansion property, we show that the diameter of our tree network is constant),
2) Provable performance guarantees. We evaluate our proposal by a rigorous performance analysis, and we validate this by extensive simulations.

Advantages of Proposed system
As nodes arrive and demand on the system increases, the total capacity of the system will be constant i.e. adding or removing of the node don t increases the diameter of the tree/network.
Performance is more compared to the existing system
Software Requirements
Operating System: Windows XP (for Compact ability)
Java Development Kit: JDK 1.5 or more
Compiler: User Compact ability
Database Viewing: Microsoft Access / Microsoft Excel

Hardware Requirements
PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15 COLOR
HARD DISK : 20 GB
FLOPPY DRIVE : 1.44 MB
CDDRIVE : LG 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS