节点文献
基于批处理补丁的流媒体后缀动态缓存算法
A Dynamic Cache Algorithm of Media Suffix Based on Batch Patching
【摘要】 在IP网络上高效传输流式存储型A/V数据是实现诸如VoD等应用的基础。当前一些典型的传输方案考虑了服务器调度策略以降低骨干网带宽消耗和服务器负载,但并未考虑媒体后缀的缓存策略。本文在带前缀的OBP算法基础上提出了流媒体对象后缀的增量式缓存及快速释放算法ICBR,并推导出了采用IC算法所需的骨干网带宽的理论结果。通过针对上述两种算法的仿真实验,本文的结果表明:即使在有限的缓存容量的前提下,采用IC算法和ICBR算法对媒体对象的后缀进行动态缓存可以显著降低骨干网链路上传输的补丁数据量,其骨干网带宽消耗显著优于OBP,从而在保证客户端较小的播放启动延迟的情况下有效降低了流媒体传输中骨干网带宽的消耗和服务器的负载。
【Abstract】 It is the basis for types of applications such as VOD to deliver stored media files over IP-based network effectively. Current researches consider the server schedule schemes to decrease the consumption of backbone bandwidth and the server load while not considered the cache policy of media suffix. This paper proposes an Incremental Caching Burst Release (ICBR) algorithm of media suffix that works upon the Optimized Batch Patching scheme,the theoretical expression of the aggregate transmission rate over the backbone network is derived when using the incremental caching algorithm. The results of simulation show that, even the cache capacity is limited,our algorithm can remarkably reduce the patching traffic of the backbone,thus outperforms OBP that with prefix cached by reducing the consumption of backbone bandwidth and the load of the original server while still have low startup latency of client side playback.
【Key words】 CDN; Streaming media; Cache proxy; Batch patching; Prefix caching; Suffix caching;
- 【文献出处】 计算机科学 ,Computer Science , 编辑部邮箱 ,2004年11期
- 【分类号】TN919.8
- 【下载频次】37