A Distributed Protocol to Serve Dynamic Groups for Peer-to-Peer Streaming

Abstract Peer-to-peer (P2P) streaming has been widely deployed over the Internet. A streaming system usually has multiple channels, and peers may form multiple groups for content distribution. In this paper, we propose a distributed overlay framewor (called !"esh) for dynamic groups where users may fre#uently hop from one group to another while the total pool of users remain stable. !"esh first builds a relatively stable mesh consisting of all hosts for control messaging. $he mesh supports dynamic host %oining and leaving, and will guide the construction of delivery trees. &sing the 'elaunay $riangulation ('$) protocol as an e(ample, we show how to construct an efficient mesh with low maintenance cost. )e further study various tree construction mechanisms based on the mesh, including embedded, bypass, and intermediate trees. $hrough simulations on Internet-li e topologies, we show that !"esh achieves low delay and low lin stress. Algorithm Used: Aggregation and delegation algorithm, 'elaunay $riangulation ('$) Protocol

Existing System:
P2P overlay networ , hosts are responsible for pac ets replication and forwarding. A P2P networ only uses unicast and does not need multicast capable routers. It is, hence, more deployable and fle(ible. *urrently, there are two types of overlays for P2P streaming+ tree structure and gossip mesh. $he first one builds one

or multiple overlay tree(s) to distribute data among hosts. ,(amples include application-layer multicast protocols. $he e(isting networ ing infrastructure are multicast capable. ,merging commercial video transport and distribution networ s heavily ma e use of IP multicasting. -owever, there are many operational issues that limit the use of IP multicasting into individual autonomous networ s. .urthermore, only trusted hosts are allowed to be multicast sources. $hus, while it is highly efficient, IP multicasting is still not an option for P2P streaming at the user level.

Proposed System:
In the Proposed applications, as peers may dynamically hop from one group to another, it becomes an important issue to efficiently deliver specific contents to peers. /ne obvious approach is to broadcast all contents to all hosts and let them select the contents. *learly, this is not efficient in terms of bandwidth and end-to-end delay, especially for unpopular channels. "aintaining a separate and distinct delivery overlay for each channel appears to be another solution. -owever, this approach introduces high control overhead to maintain multiple dynamic overlays. )hen users fre#uently hop from one channel to another, overlay reformation becomes costly and may lead to high pac et loss In this paper, we consider building a data delivery tree for each group. $o reduce tree construction and maintenance costs, we build a single shared overlay mesh. $he mesh is formed by all peers in the system and is, hence, independent of %oining and leaving events in any group. $his relatively stable mesh is used for control messaging and guiding the construction of overlay trees. )ith the help of the mesh, trees can be efficiently constructed with

no need of loop detection and elimination. !ince an overlay tree serves only a subset of peers in the networ , we term this framewor !ubset-"esh, or !"esh.

odules:
!" Peer to Peer #et$or% odule:

P2P streaming system, the server (or a set of servers) usually provides multiple channels. A peer can freely switch from one channel to another, Peers in the same group share and relay the same streaming content for each other &" Distributed partition detection odule:

)e use 'elaunay $riangulation ('$) as an e(ample. )e propose several techni#ues to improve the '$ mesh, e.g., for accurately estimating host locations and distributed partition detection. 0ased on the mesh, we study several tree construction mechanisms to trade off delay and networ resource consumption automatically Ad%ust itself to form anew mesh. $he trees on top of it will then accordingly ad%ust tree nodes and tree edges. Also note that in !"esh a host may %oin as many groups as its local resource allows. If a host %oins multiple groups, its operations in different groups are independent of each other.

.ig 1+ 'istributed detection peer to peer $wo ad%acent triangles nodes ' "Dynamic (oining )ost odule:

A %oining host, after obtaining its coordinates, sends a "esh2oin message with its coordinates to any host in the system. "esh2oin is then sent bac to the %oining host along the '$ mesh based on compass routing. !ince the %oining host is not a member of the mesh yet, it can be considered as a partitioned mesh consisting of a single host. $he "esh2oin message finally triggers the partition recovery mechanism at a particular host in the mesh, which helps the new host %oin the mesh.

* " Path Aggregation for +oS Provisioning

odule:

$wo independent connections across domains A and 0 are set up, which leads to high usage of long paths and hence high networ resource consumption. .urthermore, in the traditional '$ protocol, a host may have many children. -owever, a host often has a node stress threshold 3 for each group depending on its resource. $o address these problems, we re#uire that the minimum ad%acent angle between two children of a host should e(ceed a certain threshold $ *onsider a source s and a host u in the networ . /nce u accepts a child, u chec s whether its node stress e(ceeds 3 or whether the minimum ad%acent angle between its children is less than $ It selects a pair of children with the minimum ad%acent angle and delegates the child farther from the source to the other. 4ote that after aggregation, the overlay tree is still loop free because hosts are still topologically sorted according to their distances from the source

System Specifications
)ard$are ,e-uirements 5 5 5 5 5 5 5 !6!$," + Pentium I7 2.8 9-: -A;' 'I!3 + 8< 90 .=/PP6 ';I7, + 1.88 "0 "/4I$/; + 1> 79A colour "/&!, + =ogitech. ;A" + 2>? "0 3,60/A;' + 11< eys enhanced.

Soft$are ,e-uirements 5 5 5 /perating system +- )indows @P Professional .ront ,nd +- 2ava $echnology $ool +,clipse A.A