Merging video streams in a multimedia storage server: complexity and heuristics
- Cite this article as:
- Lau, SW., Lui, J. & Golubchik, L. Multimedia Systems (1998) 6: 29. doi:10.1007/s005300050074
- 38 Downloads
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 . 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.
Unable to display preview. Download preview PDF.