Comprehensive-factors-based scheduling algorithm for P2P media streaming

Author

Quan, Zheng ; Peng, Wang ; Jun, Li ; Zheng Xiao Le ; Song, Wang

Author_Institution

Dept. of Autom., Univ. of Sci. & Technol. of China, Hefei, China

fYear

2009

fDate

18-20 Oct. 2009

Firstpage

111

Lastpage

116

Abstract

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.

Keywords

media streaming; peer-to-peer computing; scheduling; P2P media streaming; comprehensive-factor-based scheduling; data chunk; peer request chunk; Bandwidth; Delay effects; Delay estimation; Peer to peer computing; Robustness; Round robin; Scheduling algorithm; Streaming media; System performance; Throughput; P2P media streaming; continuity index; data scheduling; startup delay; throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Broadband Network & Multimedia Technology, 2009. IC-BNMT '09. 2nd IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-4590-5

Electronic_ISBN

978-1-4244-4591-2

Type

conf

DOI

10.1109/ICBNMT.2009.5348394

Filename

5348394