Merging Video Streams in Multimedia Storage Server: Complexity and Heuristics
Lists
Only you see this
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.
BibTeX
@article{lau1998merging,
author = {Siu-Wah Lau and John C. S. Lui and Leana Golubchik},
title = {{Merging Video Streams in Multimedia Storage Server: Complexity and Heuristics}},
journal = {Multim. Syst.},
year = {1998},
doi = {10.1007/s005300050074},
}Loading related content...