Share Email Print

Proceedings Paper

New class of constant data length retrieval algorithms for video servers with VBR streams
Author(s): Ernst W. Biersack; Frederic Thiesse
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 November 1996
PDF: 14 pages
Proc. SPIE 2916, Multimedia Storage and Archiving Systems, (1 November 1996); doi: 10.1117/12.257301
Show Author Affiliations
Ernst W. Biersack, Institut Eurecom (France)
Frederic Thiesse, Institut Eurecom (France)

Published in SPIE Proceedings Vol. 2916:
Multimedia Storage and Archiving Systems
C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top