A schedule algorithm of peer-to-peer VoD system

Recently, there are many research interests in providing efficient and scalable Video-on-Demand (VoD) service over Peer-to-Peer (P2P) network. In P2P VoD system, an overlay is established among users who are interested in the same clip of a video, and users pull the video content from the server and neighboring peers. However, stringent quality-of-service (QoS) requirements for VoD service, as well as dynamically changing and heterogeneous network capacity in today´s best effort Internet, bring many challenges. In this paper, we introduce a novel content scheduling algorithm for topology-aware overlay in which users self-organize into groups. Within the same group, users usually have similar network conditions and can easily collaborate with each other to improve availability of VoD service; furthermore we proposed an intergroup content schedule strategy to improve efficiency of video content delivery between groups. Our simulation results show that the latency in our proposed architecture is less than that of the randomly P2P overlay VoD system, and has the capability to accommodate users´ view quality effectively during VoD service.