The Research On Cooperative Transmission Of Peer To Peer Streaming

With the progress of multimedia, networks and computer technologies, streaming service is getting increasingly popular and has become one of the most important applications over the Internet. Streaming media has large amount of data, high real-time request and strict QoS guarantee, therefore the traditional Internet service faces great challenges. Because of good scalability, low-cost and easy deployment, the peer to peer system has become one of the most effective solutions for streaming service over the Internet. This paper hence focuses on the study of the cooperative transmission of peer to peer streaming in order to improve the throughput of the peer and raise the streaming QoS.The major contents of the paper are listed as follows:Firstly, the problem of the peer to peer streaming cooperative transmission is illustrated. It can be devided into two sub-problems. The first is the construction and maintenance of peer to peer networks, while the second is the design of a appropriate algorithm for data transmission. In addition, three indices, the throughput, continuity index and start up delay, are given for evaluating the performance of peer to peer streaming QoS, and then the model of peer to peer streaming is given.Secondly, the peer to peer streaming transimission is devided into two case single streaming and multi-streaming in this paper. For single streaming case, a priority for each chunk of streaming data is designed according to the chunk's emergency, as well as the rarity property. Each peer requests the chunks that are not cached in itself according to the designed priority. In order to eastimate the network bandwidth more accurately, a geometric algorithm is proposed in this paper. Based on the chunk priority and the geometric algorithm for eastimating the network bandwidth, a Comprehensive Factors Based media data cooperatively transmitted algorithm (CFB for short) is raised for single streaming. Simulation results show that the CFB algorithm for media streaming cooperatively transimitted over peer to peer system outperforms traditional algorithms.For multi-streaming case, a model is proposed for single layered coding, layered coding, and multiple description coding through introducing a weight for each streaming. For the construction of peer to peer networks, the concept of virtual peer is introduced. For the maintenance of the networks, a leaky bucket algorithm is studied in the paper. The CFB round-robin algorithm which extended from single streaming CFB algorithm is proposed for cooperatively data transmission in multi-streaming case. Simulation results show that the CFB round-robin algorithm outperforms emergency first and high weight first round-robin algorithms.