Comprehensive-factors-based scheduling algorithm for P2P media streaming

A comprehensive-factors-based (CFB) scheduling algorithm is proposed for Peer-to-Peer media streaming. In CFB, considering the number of chunks' suppliers and urgency, a priority is defined for each data chunk and the neighbours' bandwidth is effectively evaluated. A peer requests chunks from neighbors according to priorities as well as bandwidth. Simulation results show that the proposed CFB scheduling algorithm for Peer-to-Peer media streaming outperforms conventional scheduling algorithms in peer average throughput, continuity index and start delay.

[1]  Bo Li,et al.  CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Qiang Fu,et al.  FBSA: A Self-adjustable Multi-source Data Scheduling Algorithm for P2P Media Streaming , 2007, MCAM.

[3]  Reza Rejaie,et al.  Adaptive multisource streaming in heterogeneous peer-to-peer networks , 2005, IS&T/SPIE Electronic Imaging.

[4]  Bo Li,et al.  Coolstreaming: Design, Theory, and Practice , 2007, IEEE Transactions on Multimedia.

[5]  Vinay S. Pai,et al.  Chainsaw: Eliminating Trees from Overlay Multicast , 2005, IPTPS.

[6]  Reza Rejaie,et al.  PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.