A Novel Content Scheduling Algorithm for Peer-to-Peer VoD System
The ever improving network infrastructure in combining with the emerging Peer-to-Peer(P2P) framework offer new opportunities for providing efficient and scalable Video-on-Demand (VoD) service over heterogeneous network. An important question towards enabling such VoD services using P2P networks is the design of algorithms for scheduling the propagation of content. In this paper, we propose 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; moreover we address the problem of intergroup content distribution with network coding technology 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 random P2P overlay VoD system, and has the capability to accommodate the stringent quality-of-service (QoS) requirements of P2P VoD services.
video-on-demand peer-to-peer content scheduling algorithm
Quan Gu
School of Computer Science Huazhong University of Sci.& Tech.School of Computer Science Wuhan University of Sci.& Tech.Wuhan, China
国际会议
太原
英文
172-175
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）