Share Email Print
cover

Proceedings Paper

Rate-constrained bandwidth smoothing for delivery of stored video
Author(s): Wu-chi Feng
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

Bandwidth smoothing techniques for the delivery of compressed prerecorded video have been shown effective in removing the burstiness required for the continuous playback of stored video. Given a fixed client-side buffer, several bandwidth smoothing algorithms have been introduced that are provably optimal under certain constraints. These algorithms, however, may be too aggressive in the amount of data that they prefetch, making it more difficult to support VCR functions that are required for interactive video-on- demand systems. In this paper, we introduce a rate- constrained bandwidth smoothing algorithm for the delivery of stored video that, given a fixed maximum bandwidth rate minimizes both the smoothing buffer requirements as well as the buffer residency requirements. By minimizing the buffer residency times, the clients and servers can remain more tightly coupled making VCR functions easier to support. A comparison between the rate-constrained bandwidth smoothing algorithm and other bandwidth smoothing algorithms is presented using a compressed full-length movie.

Paper Details

Date Published: 24 January 1997
PDF: 12 pages
Proc. SPIE 3020, Multimedia Computing and Networking 1997, (24 January 1997); doi: 10.1117/12.264304
Show Author Affiliations
Wu-chi Feng, The Ohio State Univ. (United States)


Published in SPIE Proceedings Vol. 3020:
Multimedia Computing and Networking 1997
Martin Freeman; Paul Jardetzky; Harrick M. Vin, Editor(s)

© SPIE. Terms of Use
Back to Top