Based Gossip Protocol For P2p Streaming Media Live

With the rapid development of Internet, streaming media technology that can meet the requirement of "downloading and playing at the same time" has grown soon. P2P (Peer-to-Peer) technology pushes multicast from the network layer to the application layer, so that, it can make full use of various nodes on Internet to calculate on equal basis. With great advantages on utilization, scalability and fault tolerant, it is soon applied to streaming media services. So the p2p streaming media technology formed.This paper introduces the development and the related technologies of p2p streaming media firstly. Then it discusses two main P2P streaming media model: the tree-based protocol model and the Gossip-based protocol model. Comparing the two models through simulation, it draws a conclusion that the unstructured Gossip-based protocol model is more suitable for P2P streaming media living broadcasting in dynamic network environment. So the paper focuses on the node selection strategy and the data transmission distribution strategy about p2p streaming media living broadcasting of the Gossip-based protocol model. On the side of node selection strategy, the paper improves the topology-aware selection strategy of CollectCast. To resolve the key question on bandwidth distribution of a shared path, it provides a segment-bandwidth distribution method when many active nodes shares the same segment, and creates a new nodes selecting arithmetic which can reach maximum effective bandwidth and little arithmetic complexity. And it creates another maximum rate selecting arithmetic to solve the problem of the maximum available bandwidth selecting arithmetic which can make a single node obtain little bandwidth and promote many nodes. On the side of data transmission distribution strategy, with a push-and-pull streaming media transmission strategy, the paper indicates that a good data distribution strategy is very important for playing delay when using the push method. It also gives a method to calculating playing delay, proves the least value of playing delay, puts forward a data distributing arithmetic which makes the playing delay of the receiving nodes to be the least, and properly sets the condition of resending data of the push mode. The effectiveness of the arithmetic is proved through simulating experiments in the end.