Merging video streams in a multimedia storage server: complexity and heuristics
Merging video streams in a multimedia storage server: complexity and heuristics
复制标题
在多媒体存储服务器中合并视频流：复杂性和启发式
DOI：
10.1007/s005300050074
复制
发表时间：
1998
影响因子：
3.9
通讯作者：
L. Golubchik
中科院分区：
文献类型：
--
作者：
S. Lau;John C.S. Lui;L. Golubchik
抽象的。由于网络、存储和数据压缩技术的最新进展，视频点播（VOD）服务在经济上已经变得可行。设计一个视频存储服务器，使其能够有效地按需服务于大量并发请求，是一项具有挑战性的任务。完成此任务的一种方法是通过数据和资源共享技术减少对VOD服务器的I/O需求。数据共享的一种形式是[5]中提出的流合并方法。在本文中，我们形式化的静态版本的流合并问题，推导出上界的I/O需求的静态流合并，并提出有效的启发式算法的静态和动态版本的流合并问题。
Abstract. Due to recent advances in network, storage and data compression technologies, video-on-demand (VOD) service has become economically feasible. It is a challenging task to design a video storage server that can efficiently service a large number of concurrent requests on demand. One approach to accomplishing this task is to reduce the I/O demand to the VOD server through data- and resource-sharing techniques. One form of data sharing is the stream-merging approach proposed in [5]. In this paper, we formalize a static version of the stream-merging problem, derive an upper bound on the I/O demand of static stream merging, and propose efficient heuristic algorithms for both static and dynamic versions of the stream-merging problem.