Abstract
The transfer of prerecorded, compressed video requires multimedia services to support large fluctuations in bandwidth requirements on multiple time scales. Bandwidth smoothing techniques can reduce the burstiness of a variable-bit-rate stream by prefetching data at a series of fixed rates, simplifying the allocation of resources in video servers and the communication network. Given a fixed client-side prefetch buffer, several bandwidth smoothing algorithms have been introduced that are provably optimal under certain constraints. This paper presents a collection of metrics for comparing these smoothing algorithms and evaluating their cost-performance trade-offs. Due to the scarcity of available trace data, we have constructed a video capture testbed and generated a collection of twenty full-length, motion-JPEG encoded video clips. Using these video traces and a range of client buffer sizes, we investigate the interplay between the performance metrics through simulation experiments. The results highlight the unique strengths and weaknesses of each algorithm.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 58-66 |
| Number of pages | 9 |
| Journal | Proceedings - IEEE INFOCOM |
| Volume | 1 |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 16th IEEE Annual Conference on Computer Communications, INFOCOM. Part 1 (of 3) - Kobe, Jpn Duration: Apr 7 1997 → Apr 12 1997 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- Electrical and Electronic Engineering