Dynamic Peer Selection Based on Buffer Availability in P2P VoD Systems

• Main Authors: Ching-An Tang, 湯景安
• Other Authors: Lu, Chun-Hsien
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/25628599139952700786

碩士 === 輔仁大學 === 資訊工程學系碩士班 === 101 === Because video streaming service requires a lot of bandwidth, traditional client-server model has become inadequate due to the bandwidth and efficiency bottleneck. To solve this problem, the Peer-to-peer technology used in video streaming services is an inevitable trend. Among many Peer-to-peer technologies, the BT protocol is the most widely known, but it must be adapted to be used for video streaming. On neighbor selection, it is useless to choose a neighbor with a large gap between the playback points, because users' playback points will differ according to their join times. Even if we choose a neighbor with a small gap between the playback points, the network traffic variation may change the transmission performance and the contribution of the buffer. Such that we need to reconsider whether to replace the existing neighbors. In this paper, we propose a dynamic peer selection mechanism based on buffer availability. Each peer calculates the availabilities of its neighbors using their buffer overlap and load. When a peer wants to choose a neighbor to send a request, it gives preference to the peer with the maximum availability. Using this strategy can improve the upload utilization between peers, reduce the load on the server, and enhance the video qualities that all user experiences. Simulation results show that our mechanism can improve the continuity index by 26%, and reduce the server's load by 24%. Keywords: peer-to-peer network, video streaming, dynamic neighbor selection, request peer selection