关键词: 数据分发, 时序约束, 调度

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