An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha University of Central Florida August 31, 2007 @ P2P-TV, Kyoto.

An Alliance based Peering An Alliance based Peering Scheme for P2P Live Media Scheme for P2P Live Media

StreamingStreaming

Darshan PurandareDarshan Purandare Ratan GuhaRatan Guha

University of Central FloridaUniversity of Central Florida

August 31, 2007 @ P2P-TV, KyotoAugust 31, 2007 @ P2P-TV, Kyoto

P2P-TV 2007 Darshan Purandare 2

Outline

Chunk based P2P modelsChunk based P2P models

Current Issues

Proposed peering scheme

Discussion and summary


Chunk based P2P models

Server

1

2

5

3

4

…

…

…

…

…

…

…

…

1

3 Stream is split into Stream is split into piecespieces


Working Philosophy

Peers exchange buffer map of data availability

Retrieve the missing pieces and upload pieces to neighbors

Scheduling algorithm finds which pieces to retrieve and from whom

Partnership refinement helps to obtain better

peers in terms of uploading rate


Outline


Current IssuesCurrent Issues

Proposed peering scheme



Current Issues

Quality of Service Quality of Service can improve [Hei et al. 06]Long start up timePeer Lag

Unfairness Unfairness [Ali et al. 06]Uplink bandwidth distribution uneven

Sub-optimal uplink utilizationSub-optimal uplink utilizationMay affect QoS & Scalability

Can we do better ?Can we do better ?


Outline


Current Issues

Proposed peering schemeProposed peering scheme



Proposed Model

Chunk based paradigm but overlay formation using alliances

Nodes cluster in groups of 4-8 to form alliances

Media server relays content to PowerPower nodes

BEAM: Bit strEAMing


BEAM: Working Philosophy

A new node upon arrival obtains peerlist from TrackerPeerlist contains nodes in similar bandwidth range and similar network (if possible)

Contacts peers for stream contentStarts joining alliances or creates one

Server relays stream content to Power nodesPower nodesPower nodes changes periodically based on Utility FactorUtility Factor (UF)A node’s UF computed using: Cumulative share ratio (CSR)

Temporal share ratio (TSR)


Alliance Formation

Peerlist of Node 1:: 6, 17, 236, 17, 23 Peerlist of Node 6: 12, 22, 4312, 22, 43


Alliance Properties

A node can be a member of multiple alliances

HH: Maximum number of nodes in an Alliance

KK: Maximum number of alliances a node can join

Number of neighbors = K(H-1)


Alliance Functionality

H = 5

K = 2


Alliance Functionality

H = 5

K = 2


Why form Alliances ?

Clustering into alliances forms a small world network graph

Short Path Length

Robust to network perturbations such as churn

Close knit group ensures streaming content is

readily available within alliances

Alliance members have common trust & treaty


Small World Network

Dense local clustering (high clustering coefficient)

Some links to other part of the graph (non local)

Overlay distance is near-optimal

Robust to churn

[Watts et al., Nature,98][Watts et al., Nature,98]


Simulator Details

Streaming rate = 512 Kbps

Media Server’s Uplink = 1536 Kbps (3 links)

Heterogeneous bandwidth class

(512,128), (768,256), (1024, 512), (1536,768),

(2048, 1024)

H, K = 4, 2 (6 neighbor nodes)

Each node buffers content for 120 sec


QoS: Average Jitter Rate


QoS: Average Latency


Uplink Utilization


Fairness: Share Ratio Range


Fairness: Jitter Factor Range


Fairness: Latency Range


Summary

Alliance based peering scheme is an effective

technique to group peers

QoS, Uplink throughput and fairness results are at

par or even better than CoolStreaming

Peer lag can be improved using BEAM

Initial buffering time can be slightly improved

Our research is complementary to advance

source and channel coding techniques.


Questions or Comments

Thank You!

An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha University of Central Florida August 31, 2007 @ P2P-TV, Kyoto.

Documents