计算机工程与科学2012，Vol.34Issue(5)：7-12,6.DOI:10.3969/j.issn.1007-130X.2012.05.002
面向子流的低延迟数据调度算法
A Novel Sub-Stream-Oriented Low-Delay Scheduling Algorithm
吴国福 1窦强 1吴吉庆 1窦文华1
作者信息
- 1. 国防科学技术大学计算机学院,湖南长沙410073
- 折叠
摘要
Abstract
Peer-to-Peer streaming is an effectual and promising way to distribute media content. In this paper, we present a novel sub-stream-oriented low-delay scheduling strategy under the push-pull hybrid framework. First the sub-stream scheduling problem is transformed into the matching problem of the weighted bipartite graph. Then the well-known Hungarian Algorithm is ameliorated, and a minimum delay, maximum matching algorithm is presented. Not only maximum matching is reserved by the new improved algorithm, but also the transmitting delay of each sub-stream is as low as possible. The simulation results show that our method can greatly reduce the transmission delay.关键词
P2P流媒体/数据调度/子流/带权二部图/匹配Key words
P2P streaming/ scheduling/sub-stream/ weighted bipartite graph/matching分类
信息技术与安全科学引用本文复制引用
吴国福,窦强,吴吉庆,窦文华..面向子流的低延迟数据调度算法[J].计算机工程与科学,2012,34(5):7-12,6.
