Research On Node Selection And Data Scheduling Strategy For P2P-VoD System

With the rapid development of Internet and the widespread deployment of broadband technology, the network has gradually gone into the homes, which makes the life of people more and more inseparable from the network, and the requirement of network is becoming more and higher. At this moment, with the in-depth study of the theory of decentralization, P2 P technology is beginning to emerge in both the applications fields and in the academic field, no matter in communication, video or file downloads, P2 P has become the target in major research institutions. In system for P2P-Vo D, how to reduce the server load better and to improve the user experience of video, is always a difficult problem to study. Although some existing algorithms have made certain achievements, but still unable to provide users with more satisfactory quality of video to watch.In order to solve the problems of the existing algorithms based on P2 P streaming media on demand system of neighbor nodes selection and data scheduling this paper carried on the thorough research. First proposed a two steps based on the request of the broadcast domain neighbor nodes selection algorithm.First step by setting range, determine the node broadcast domain of request, filtered through the number, choose the suitable ones for their own node which provide data resources of nodes better. The second step is to compromise the ability of node, through the calculation in the priority of the broadcast domain node, comprehensively considering alternative nodes’ node capacity, network distance, honesty, factors such as time spent online, according to the different needs of the user to select the node.Secondly, this paper proposes a scheduling algorithm based on SVC technology data, video coding will be layered, considering the factors that may affect the data request priority by computing the priority of the request data blocks, according to the priority arrangement in the order of data block request of which requests for data transmission.Finally, through the study of the simulation experiment of two kinds of algorithms, and the chosen algorithm NCS, Metropolis- Hasting, with existing data scheduling algorithm RR, Min- Cost carried comparison and analysis, to verify the effectiveness of the proposed in this paper selected adjacent algorithm and data scheduling algorithm can achieve better performance in the performance of system, especially in such aspects as average broadcast quality, accessing to resource proportion has been effectively improved.