Sunteți pe pagina 1din 35

A DISTRIBUTED PROTOCOL TO SERVE DYNAMIC GROUPS FOR PEER-TO-PEER STREAMING

YERRISWAMY T J 11P61D5833
Monday, October 08, 2012 1

AIM
To develop PEER-TO-PEER STREAMING using distributed overlay framework called SMESH to achieve low delay and low link stress.

Monday, October 08, 2012

AGENDA
Existing System. Problems. Proposed System. P2P system and streaming. Dynamic randomization group. Smesh. Delaunay triangulation System architecture & Use case diagram. Conclusion and bibliography.

Monday, October 08, 2012

EXISTING SYSTEM

Monday, October 08, 2012

EXISTING SYSTEM
Centralized systems. Whole data.

Frames with delay.


peers dynamically hop from one group to another. efficiently deliver specific contents to peers.

Monday, October 08, 2012

PROBLEMS
Broadcasts all contents to all hosts inefficient end-to-end delay

a separate and distinct delivery overlay for each channel. high control overhead

Monday, October 08, 2012

PROPOSED SYSTEM
Peer to peer. Frames with less delay.

Stable mesh consisting of all hosts.


Group peers corresponding to each channel. Dynamic host joining and leaving.

Monday, October 08, 2012

PROPOSED SYSTEM

Monday, October 08, 2012

PROPOSED SYSTEM

Monday, October 08, 2012

PEER-TO-PEER SYSTEMS

Monday, October 08, 2012

10

PEER-TO-PEER SYSTEMS
Smesh. Control messaging.

Unicast connections.
Multiple channels A single shared overlay mesh Loop detection and elimination.
Monday, October 08, 2012 11

PEER-TO-PEER SYSTEMS

Monday, October 08, 2012

12

DYNAMIC RANDOMIZATION GROUP


Packet transmission The randomized pickup

Broadcast all contents


End-to-end delay Distinct delivery overlay High control overhead
Monday, October 08, 2012 13

SMESH

Monday, October 08, 2012

14

DATA FLOW IN SMESH

Monday, October 08, 2012

15

DELAUNAY TRIANGULATION

Monday, October 08, 2012

16

DELAUNAY TRIANGULATION

Monday, October 08, 2012

17

DELAUNAY TRIANGULATION

Monday, October 08, 2012

18

DELAUNAY TRIANGULATION MESH

Monday, October 08, 2012

19

EMBEDDED TREE

An example of building an embedded tree.


Monday, October 08, 2012 20

BYPASS TREE

An example of building a bypass tree.


Monday, October 08, 2012 21

INTERMEDIATE TREE

An example of building an intermediate tree.


Monday, October 08, 2012 22

ALGORITHM

Monday, October 08, 2012

23

ALGORITHM

Monday, October 08, 2012

24

ALGORITHM

Monday, October 08, 2012

25

USE CASE DIAGRAM

Monday, October 08, 2012

26

SYSTEM ARCHITECTURE

Monday, October 08, 2012

27

RESULT

(a) Average RDP, (b) average link stress, and (c)


Average normalized resource usage.
Monday, October 08, 2012 28

RESULT

Monday, October 08, 2012

29

ADVANTAGES
Multiple channels Multiple groups Control messaging Dynamic host joining and leaving Unicast connection Delegates data delivery to shorter path limits the node stress

Monday, October 08, 2012

30

IMPLEMENTATIONS
P2P streaming systems IPTV CCTV1 PP Live Broadband Internet access Media streaming services

Monday, October 08, 2012

31

CONCLUSION
P2P streaming networks Stable mesh

To balance the load


Low link stress

Monday, October 08, 2012

32

CONCLUSION

Monday, October 08, 2012

33

REFERENCES
[1] X. Zhang, J. Liu, B. Li, and T.-S.P. Yum, CoolStreaming/DONet: A Data-Driven Overlay Network for Peer-to-Peer Live Media Streaming, Proc. IEEE INFOCOM 05, pp. 21022111, Mar. 2005. [2] X. Liao, H. Jin, Y. Liu, L.M. Ni, and D. Deng, Anysee: Peer-to- Peer Live Streaming, Proc. IEEE INFOCOM 06, Apr. 2006. [3] Y. Tang, J.-G. Luo, Q. Zhang, M. Zhang, and S.-Q. Yang, Deploying P2P Networks for Large-Scale Live Video-Streaming Service, IEEE Comm. Magazine, vol. 45, no. 6, pp. 100-106, June 2007.

[4] PPLive, http://www.pplive.com, 2009.


[5] X. Hei, Y. Liu, and K.W. Ross, Inferring Network-Wide Quality in P2P Live Streaming Systems, IEEE J. Selected Areas in Comm., vol. 25, no. 9, pp. 1640-1654, Dec. 2007.
34

Monday, October 08, 2012

QUESTIONS!!!!!?

Monday, October 08, 2012

35

S-ar putea să vă placă și