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 , , consecutive disk rounds a constant size block from the disk, which may result 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.
This paper is published in SPIE Photonics East 1996, Multimedia storage and archiving systems, 18-19 november, 1996, Boston, USA and is made available as an electronic preprint with permission of SPIE. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.