信息通信专业SurveyonApplicationLayerMultica

《信息通信专业SurveyonApplicationLayerMultica》由会员分享，可在线阅读，更多相关《信息通信专业SurveyonApplicationLayerMultica（15页珍藏版）》请在装配图网上搜索。

1、Survey on Application Layer Multicast Introduction Application 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 co

2、st of additional traffic load in the network through an overlay-based approach. Our Survey ZIGZAG: An Efficient P2P Scheme for Media Streaming A Framework for Architecting P2P Receiver-driven Overlays Mesh Based P2P Streaming Other Related Work ZIGZAG is a p2p technique for single-source media strea

3、ming, 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 ZIGZAG NICE

4、: 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 ZIGZAG The 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 peers.ZIGZ

5、AG Split operation 1. 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 a new l

6、eader 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 members.2 In

7、 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 & departure The 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, the number o

8、f 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 RVISITING P2P RECEIVER-DRIVEN OVERLAY GOSSIP-BASED PEER DISCOVERY PARENT SELECTION CONCLUSION

9、S Mesh Based P2P Streaming Two problems about Mesh-Based P2P Mesh based P2P streaming over viewTwo bottlenecks Global Pattern of Content Delivery Diffusion Phase of a Segment Swarming Phase of a Segment CONCLUSIONS Other Related Work Layered Peer-to-Peer Streaming Peer-to-peer Streaming of Stored Me

10、dia: The Indirect Approach Adaptive Multi-Source Streaming in Heterogeneous Peer-to-Peer Networks Adaptive Multi-Source Streaming in Heterogeneous P2P Network DONet: A Data-Driven Overlay Network for Efficient Live Media Streaming Conclusion A number of recent work on application layer multicast Some of them are introduced in detail Application layer multicast is an active research topic currently Many techniques are effective, while it is difficult to overcome the inherent problems