检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:任浩 Wang Jinlin You Jiali
机构地区:[1]National Network New Media Engineering Research Center,Institute of Acoustics,Chinese Academy of Sciences [2]Graduate University of Chinese Academy of Sciences [3]State Nuclear Power Software Development Center
出 处:《High Technology Letters》2013年第2期208-213,共6页高技术通讯(英文版)
基 金: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)
摘 要: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 proposed.The algorithm 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 dynamically 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 resources to transmit data to reduce server pressure effectively and improve system scalability.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.
关 键 词:peer-to-peer (P2P) STREAMING data scheduling PRIORITY request allocation
分 类 号:TN919.8[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.61.19