Peer priority based data scheduling algorithm in P2P streaming system

作     者：任浩 Wang Jinlin You Jiali 

作者机构：National Network New Media Engineering Research CenterInstitute of AcousticsChinese Academy of Sciences Graduate University of Chinese Academy of Sciences State Nuclear Power Software Development Center 

出 版 物：《High Technology Letters》 (高技术通讯（英文版）)

年 卷 期：2013年第19卷第2期

页      面：208-213页

核心收录：

学科分类：0810[工学-信息与通信工程] 08[工学] 081001[工学-通信与信息系统] 

基　　金：Supported by the National High Technology Research and Development Program of China(No.2009AA01A339,2008AA01A317) the National Natural Science Foundation of China for Distinguished Young Scholars(No.60903218F0208) the Science and Technology Support Plan of China(No.2008BAH28B04) 

主　　题：peer-to-peer (P2P) streaming data scheduling priority request allocation 

摘      要：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 multisender based P2P streaming system,a peer priority based scheduling algorithm is *** algorithm calculates neighbors priority based on peers historical service evaluation as well as how many wanted data that the neighbor *** data request allocated to each neighbor is adjusted dynamically according to the priority when *** with high priority are preferred to allocate more data *** shows the algorithm can make full use of neighbors bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.