ASimpleModelforAnalyzingP2PStreamingProtocols.ppt

* * * * * * * * Introduce chunk selection strategies: Greedy Strategy and Rarest First Strategy. * p(1)=1/M, M is the number of total peers in the network. p(i) is the probability for position i filled * Introduce the conclusions from the continuous expressions. Discuss the disadvantage and advantage for each chunk selection strategy. The relative advantage for Rarest First Strategy is the scalability, which means the quality continuity would not reduce quickly when the number of peers increases sharply. The relative advantage for Greedy Strategy is the achievable better continuity when the number of peers is quite stable. * Based on above discussion, A mixed strategy is designed. For the chunks, which are rare in the network, we can use the Rarest First Strategy to increase them quickly. For those chunk, which are too many in the network, a Greedy Strategy can achieve a much better continuity. The buffer can be divided into two parts. In the first part, the Rarest First Strategy is executed to get a good scalability. Then in the second part, the Greedy Strategy is executed to get a better continuity. * * * * * * * * * * * A Simple Model for Analyzing P2P Streaming Protocols Zhou Yipeng Chiu DahMing John, C.S. Lui The Chinese University of Hong Kong Outline Introduction Model Chunk Selection Strategies Simulation Conclusion Introduction Unicast Client server is the bottleneck and waste bandwidth Router Waste Bandwidth Bottleneck Untapped bandwidth resource Weak point Introduction Application Layer Multicast (or CDN) Rely on a single distribution tree server Leaf peers Introduction P2P Streaming System -P2P resolves this scalability problem by using all resources of all clients. It is like using multiple trees simultaneously to deliver content. Server Peer Peer Peer Peer Peer Peer Fully connected Peers maintain: * buffer * neighbor list Introduction P2P application: -file distribution, p2p streaming Summary work on p2p st