In the context of a communication network with no QoS guarantees, we describe the problem of adaptive streaming of layer encoded multimedia presentation data as a two-phase decision problem. In phase one the application transfers only base layer data that comprise a presentation of minimum quality, which is stored at the client. When the application determines that commencing play out will result in an uninterrupted presentation of at least minimum quality, it does so, and then transitions into phase two. The application then loops on the decision on which data to send next: another base layer, or an enhancement layer. We present two different algorithms for making this decision, based on two different presentation quality metrics: the total quality metric, which yields an optimization problem that can be solved with dynamic programming, and the refined max-min metric, which yields a computationally inexpensive algorithm for computing an optimal decision. We also consider the problem of progressively rendering static objects after their start times as a means of improving presentation quality. Using a slide show presentation with a randomly generated sequence of layer-encoded JPEG images, we compare the various approaches.
Adaptive streaming of layer-encoded multimedia presentations
Journal of VLSI Signal Processing, Special issue on multimedia communications, Volume 34 N°1, 2003
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in Journal of VLSI Signal Processing, Special issue on multimedia communications, Volume 34 N°1, 2003 and is available at : http://dx.doi.org/10.1023/A:1022817821444
PERMALINK : https://www.eurecom.fr/publication/677