DYNAMIC GROUP PEER FORMATION AND FINDER BY PARALLEL CONNECTIVITY

UNDER THE GUIDENCE OF BY

Ms. V.VIANCY M.Tech.,(AP/IT) MEENAKSHI.M

PRIYA.G

BASE PAPER DETAIL

TITLE:

Locating Equivalent Servants over P2P Networks.

IEEE transactions on network and service management, vol. 8, no. 1, March 2011

AUTHOR:

Guido Marchetto, Luigi Ciminiera, Marco Papa Manzillo, Fulvio Risso, Livio Torrero

CONTENT

ABSTRACT MOTIVATION INTRODUCTION EXISTING SYSTEM PROPOSED SYSTEM HARDWARE AND SOFTWARE REQUIREMENTS PHASE I PHASE II PHASE III IMPLEMENTATION IDEA REFERENCES

ABSTRACT Peer-to-peer (P2P) streaming widely deployed over the

Internet. A streaming system has multiple channels, and peers may

form multiple groups for content distribution. we propose a distributed overlay framework (called SMesh)

for dynamic groupings to make content distribution. SMesh (Stable Mesh) first builds a stable mesh. mesh supports dynamic host joining, leaving, and guide the

construction of delivery trees.

MOTIVATION

Peer to peer network:

peer to peer networks are mainly used to locate unique resources across the Internet.

For certain request any peer can function as a client or as a server (decentralized).

information is distributed among all peers

INTRODUCTION

“servants” in charge will provide the services. Goal : to achieve performance, scalability, and

robustness. Challenge of p2p networks is to achieve efficient

resource discovery. Network and data are completely decentralized. Networks are highly dynamic with frequent entry

EXISTING SYSTEM

System composed of peers joining the network with some loose rules, without any prior knowledge of the topology.

Network uses random walks as the mechanism to send queries across the overlay with a limited scope.

Here they adopt the topology of a generic DHT, with a fixed number of neighbors for each node.

Each peer maintains a small routing table consisting of its “neighboring” peers’ Node IDs and IP addresses. It increases the complexity of the network.

PROPOSED SYSTEM

SMesh (Stable Mesh) first builds a relatively stable mesh consisting of all hosts for control messaging.

The mesh supports dynamic host joining and leaving and will guide the construction of delivery trees.

we consider building a data delivery tree for each group. To reduce tree construction and maintenance costs, we build a single shared overlay mesh.

With the help of the mesh, trees can be efficiently constructed with no need of loop detection and elimination. Since an overlay tree serves only a subset of peers in the network, we term this framework SMesh.

SYSTEM ARCHITECTURE

HARDWARE AND SOFTWARE REQUIREMENTS

HARDWARE System : Pentium IV 2.4 GHz. Hard Disk : 40 GB. Ram : 256 Mb.

SOFTWARE Os : Windows XP. JDK : 1.5/ 1.6 and above. Front End : JAVA, Swing(JFC). Database : JDBC.

PHASE -I

Group peer creation enter their details Add into control of control peer

SCREEN SHOT

Group peer getting authentication

SCREEN SHOT

SCREEN SHOT

SCREEN SHOT

PHASE-II

Source peer creation Source peer authentication checking Source peer sending details to all group peer Control peer creation Check the details of group peer

details(password,user name)

SCREEN SHOT

SCREEN SHOT

SCREEN SHOT

SCREEN SHOT

SCREEN SHOT

PHASE III(IDEA)

Sending details to specified group peer Creating report for knowing the uploading file

details in control peer

REFERENCE

http://support.microsoft.com/kb/150575 http://www.site.uottawa.ca/~jingwu/publications/journal/

COVER-PAGE-peer-to-peer-network-architecture.pdf http://www.sysdesign.ca/archive/berkes_gnutella_freenet

.pdf http://www.wikinvest.com/concept/Cloud_Computing