基于缓存区段的P2P流媒体调度算法  

P2P Media Streaming Scheduling Algorithm Based on Cache Segments

作　　者：刘永卫[1] 唐新春 刘戊开 陈谦 

机构地区：[1]湖南创智数码科技股份有限公司

出　　处：《计算机工程与科学》2008年第6期66-68,94,共4页Computer Engineering & Science

基　　金：国家863计划资助项目(2006AA01Z323)

摘　　要：由于P2P环境的高度动态性和异构性,以及流媒体服务的高宽带和连续性强的特征,P2P流媒体系统中数据块和发送节点的调度便显得尤为重要。本文针对数据驱动的P2P流媒体系统提出了基于缓存区段的调度算法,即根据时间线将缓存划分为反映不同紧急程度的若干区段,以便节点根据资源副本数和紧急程度作出合理调度。模拟实验表明,在高动态性的网络情况下,基于缓存区段的调度算法仍然能够很好地保证媒体流的连续性以及节点间的协作。Due to the high dynamics and heterogeneity of P2P, and the high bandwidth and continuity of media streaming services, the scheduling of data blocks and transfer nodes in the P2P media streaming systems is particularly important. This paper presents a scheduling algorithm based on the cache segments for data-driven P2P streaming media systems. According to the time llne, a cache is divided into several segments, and each segment is applied to a reasonable scheduling algorithm. Simulation results show that, even in highly dynamic circumstances of the network, the scheduling algorithm can still guarantee the continuity of streaming media and the collaboration between the nodes.

关 键 词：对等网 流媒体 缓存区段 局部最少优先 最早时限优先 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]