摘要
提出一种基于对等网的流媒体数据分配算法(DA2SMp2p),可根据网络环境的变化动态调整数据分配,在提供节点中途失效时,可以比MBDAp2p算法、OTSp2p算法和Algorithm_1算法保持更好的流媒体连续性,提供节点没有失效时,所取得的段缓冲延迟与MBDAp2p算法相同,比OTSp2p算法和Algorithm_1算法小。DA2SMp2p算法、MBDAp2p算法和OTSp2p算法保持连续播放的最小缓冲延迟相同,都比Algorithm_1算法小。
This paper proposes a Data Assignment Algorithm Based on Peer to Peer for Streaming Media(DA2SMp2p). The algorithm can dynamically adjust the data assignment according to the changes of the network. When a supply peer is invalidated, the algorithm can keep more continuity of streaming media than Minimum Buffering Delay media data Assignment algorithm(MBDAp2p), an optimal media data assignment algorithm(OTSp2p) and Algorithm_1. When no supply peer is invalidated, segment buffering delay of DA2SMp2p is the same as MBDAp2p and smaller than OTSp2p and Algorithm-1 while the minimum buffering delay of a continuous playback for DA2SMp2p, MBDAp2p and OTSp2p algorithms is same. The minimum buffering delay of a continuous playback for Algorithm_1 is the biggest.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第17期12-14,共3页
Computer Engineering
基金
国家“973”计划基金资助项目(2007CB307100,2007CB307103)
国家杰出青年科学基金资助项目(60525110)
新世纪优秀人才支持计划基金资助项目(NCET-04-0111,NSFC(90604012))
2007年度辽宁大学青年科研基金资助项目(2007LDQN08)
电子信息产业部发展基金资助项目“基于3G的移动业务应用系统”
关键词
流媒体
对等网
缓冲延迟
数据分配
streaming media
peer to peer
buffering delay
data assignment