电子学报2012，Vol.40Issue(2)：365-370,6.DOI:10.3969/j.issn.0372-2112.2012.02.025
DSF:一种时序约束下的快速数据分发算法
DSF: A Fast Data Distribution Algorithm under Timing Constraint
摘要
Abstract
The applications for large-scale data distribution under timing constraint have been widely deployed on Internet. Most existing systems organize the involved clients with mesh structure and control the data distribution through the scheduling algorithms running on requesting peers. However, requesting peers request data only according to their own needs, regardless of the overall service quality of the system. Therefore, we take aim at improving the overall service quality of the system and propose a scheduling algorithm running on serving peers:DSF (Deadline Sensitive Fast distribution algorithm), which transfers urgently needed data to the peers that have strong follow-up service ability with high priority, to reduce the ratio of late data chunks and improve the service capacity of the whole system. The experimental results show that DSF has better performance with respect to transmission quality,distribution rate and load balance than the frequently used scheduling algorithms.关键词
数据分发/时序约束/调度Key words
data distribution/timing constraint/ scheduling分类
信息技术与安全科学引用本文复制引用
吴吉庆,彭宇行,刘锋..DSF:一种时序约束下的快速数据分发算法[J].电子学报,2012,40(2):365-370,6.基金项目
国家973重点基础研究发展规划(No.2011CB302601) （No.2011CB302601）
国家863高技术研究发展计划(No.2009AA01Z142) （No.2009AA01Z142）
