Multimedia Systems

, Volume 6, Issue 1, pp 29–42

Merging video streams in a multimedia storage server: complexity and heuristics

  • Siu-Wah Lau
  • John C.S. Lui
  • Leana Golubchik
Special issue: Multimedia Information Systems

DOI: 10.1007/s005300050074

Cite this article as:
Lau, SW., Lui, J. & Golubchik, L. Multimedia Systems (1998) 6: 29. doi:10.1007/s005300050074

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.

Key words:Multimedia storage systems – Video-on-demand – Stream merging – I/O stream sharing – Complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Siu-Wah Lau
    • 1
  • John C.S. Lui
    • 2
  • Leana Golubchik
    • 3
  1. 1. Department of Computer Science and Engineering, The Chinese University of Hong Kong; e-mail: swlau@cs.cuhk.edu.hk HK
  2. 2. Department of Computer Science and Engineering, The Chinese University of Hong Kong; e-mail: cslui@cs.cuhk.edu.hk HK
  3. 3. Department of Computer Science, Columbia University, New York, NY 10027, USA; e-mail: leana@cs.columbia.edu US

Personalised recommendations