Title :
A novel content scheduling algorithm for Peer-to-Peer VoD system
Author_Institution :
Sch. of Comput. Sci., Huazhong Univ. of Sci. & Tech., Wuhan, China
Abstract :
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.
Keywords :
content management; network coding; peer-to-peer computing; quality of service; scheduling; telecommunication network topology; video on demand; video signal processing; video streaming; P2P network; P2P overlay VoD system; VoD service; content propagation; content scheduling; heterogeneous network; intergroup content distribution; network coding; network infrastructure; peer-to-peer VoD system; quality of service; topology-aware overlay; video content delivery; video streaming; video-on-demand; Bandwidth; Network coding; Peer to peer computing; Quality of service; Scheduling algorithm; Servers; Streaming media; Peer-to-Peer; Video-on-Demand; content scheduling algorithm;
Conference_Titel :
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4244-7235-2
Electronic_ISBN :
978-1-4244-7237-6
DOI :
10.1109/ICCASM.2010.5623236