Peer priority based data scheduling algorithm in P2P streaming system

• Published in: 高技术通讯（英文版） Vol. 19; no. 2; pp. 208 - 213
• Main Author: 任浩 Wang Jinlin You Jiali
• Format: Journal Article
• Language: English
• Published: State Nuclear Power Software Development Center, Beijing 100029, P.R.China%National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, P.R.China 01.06.2013; Graduate University of Chinese Academy of Sciences, Beijing 100190, P.R.China; National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, P.R.China
• Subjects: P2P; 优先级; 传输数据; 可扩展性; 带宽资源; 数据请求; 流媒体系统; 调度算法; request allocation; streaming; data scheduling; priority; peer-to-peer (P2P)
• ISSN: 1006-6748
• DOI: 10.3772/j.issn.1006-6748.2013.02.016

In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors＇ bandwidth resources when allocating data request among several senders in the multi- sender based P2P streaming system, a peer priority based scheduling algorithm is proposed. The al- gorithm calculates neighbors＇ priority based on peers＇ historical service evaluation as well as how many wanted data that the neighbor has. The data request allocated to each neighbor is adjusted dy- namically according to the priority when scheduling. Peers with high priority are preferred to allocate more data request. Experiment shows the algorithm can make full use of neighbors＇ bandwidth re- sources to transmit data to reduce server pressure effectively and improve system scalability.