【大学】信息通信专业 Survey on Application Layer Multica

1、Survey on Application Layer Multicast整理课件IntroductionApplication layer multicast is increasingly being used to overcome the problem of non-ubiquitous deployment of IP multicast across heterogeneous networks.It offers accelerated deployment, simplified configuration and better access control at the c

2、ost of additional traffic load in the network through an overlay-based approach. 整理课件Our SurveyZIGZAG: An Efficient P2P Scheme for Media StreamingA Framework for Architecting P2P Receiver-driven OverlaysMesh Based P2P StreamingOther Related Work 整理课件ZIGZAG is a p2p technique for single-source media

3、streaming, which allows the media server to distribute content to many clients by organizing them into an appropriate tree rooted at the server.It is an improvement of NICE.ZIGZAG整理课件Administrative organization of peers A hierarchical cluster structure the same with NICEZIGZAG整理课件Multicast tree of Z

4、IGZAGNICE: cluster leader of X forward messages to the member peers in X.ZIGZAG: one of Xs foreign cluster leaders forward messages to X ZIGZAG整理课件Multicast tree of ZIGZAGThe worst-case node degree of the multicast tree is O(k2).The height of the multicast tree is O(logkN) where N is the number of p

5、eers.ZIGZAG整理课件Split operation1.Separate the target cluster into U plus V (assume the original leader X is in U).2.Disconnect the links from U to Vs child members and at the same time select new parents for these child members from V itself. Similar procedure also applied to Us child members.3.Elect

6、 a new leader Y for V. Put Y into the higher cluster and let another qualified clustermate Z take over Ys ex-children.ZIGZAG整理课件Recovery1.Assume that X is failed and Y is the cluster leader of Xs children. When Y detect that X is gone, it try to find another clustermate Z to take over its cluster me

7、mbers.2In Layer0, another peer X is elected to replace X. All that should be done is just put X in the original highest layer of X.ZIGZAG整理课件Cost of peer join & departureThe join overhead is O(logkN) in terms of number of nodes to contact.The worst-case split overhead is O(k2).In the worst case,

8、 the number of peers that need to reconnect due to a failure is O(k2).The worst-case merge overhead is O(k2).ZIGZAG整理课件Comparison of NICE and ZIGZAG ZIGZAG整理课件A Framework for Architecting P2P Receiver-driven Overlays PROBLEM RVISITINGP2P RECEIVER-DRIVEN OVERLAYGOSSIP-BASED PEER DISCOVERYPARENT SELEC

9、TION CONCLUSIONS整理课件Mesh Based P2P Streaming Two problems about Mesh-Based P2PMesh based P2P streaming over viewTwo bottlenecks Global Pattern of Content DeliveryDiffusion Phase of a SegmentSwarming Phase of a Segment CONCLUSIONS整理课件Other Related WorkLayered Peer-to-Peer StreamingPeer-to-peer Stream

10、ing of Stored Media: The Indirect ApproachAdaptive Multi-Source Streaming in Heterogeneous Peer-to-Peer NetworksAdaptive Multi-Source Streaming in Heterogeneous P2P NetworkDONet: A Data-Driven Overlay Network for Efficient Live Media Streaming整理课件Conclusion A number of recent work on application layer multicastSome of them are introduced in d