Translator Disclaimer
Paper
1 November 1996 New class of constant data length retrieval algorithms for video servers with VBR streams
Author Affiliations +
Proceedings Volume 2916, Multimedia Storage and Archiving Systems; (1996) https://doi.org/10.1117/12.257301
Event: Photonics East '96, 1996, Boston, MA, United States
Abstract
We consider the problem of data retrieval from disk storage in video server where the video data are read in constant size blocks. Retrieval algorithms of this type are referred to as constant data length (CDL) retrieval algorithms. We recently introduced a new retrieval algorithm called GCDL that generalizes the CDL retrieval algorithm: GCDL reads for a video stream i during k (DOT) mi, k (epsilon) , consecutive disk rounds a constant size block from the disk, which may results in a large read-ahead requiring a large amount of buffer. In this paper, we propose two new retrieval algorithms called static and dynamic GCDLb that minimize the number of reads during consecutive disk rounds while still maintaining continuous delivery to the client. COmpared to GCDL, we show that GCDLb requires less buffer per client and can admit more clients.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ernst W. Biersack and Frederic Thiesse "New class of constant data length retrieval algorithms for video servers with VBR streams", Proc. SPIE 2916, Multimedia Storage and Archiving Systems, (1 November 1996); https://doi.org/10.1117/12.257301
PROCEEDINGS
14 PAGES


SHARE
Advertisement
Advertisement
Back to Top