Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Video-on-demand services: efficient transportation and decompression of variable bit rate video
Video-on-demand services: efficient transportation and decompression of variable bit rate video
IEEE/ACM Transactions on Networking (TON)
Optimal streaming of synchronized multimedia presentations
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 2)
Efficient Adaptive Media Scaling and Streaming of Layered Multimedia in Heterogeneous Environment
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
A Join--the--Shortest--Queue Prefetching Protocol for VBR Video on Demand
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Video-on-demand over ATM: constant-rate transmission and transport
IEEE Journal on Selected Areas in Communications
High-performance prefetching protocols for VBR prerecorded video
IEEE Network: The Magazine of Global Internetworking
Journal of Systems and Software
| Hi-index | 0.00 |
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. It does this by considering the deliverability and play-out quality within a sliding window of media units. 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. We compare the various approaches with a slide show presentation with a randomly generated sequence of layer-encoded JPEG images, and an Ogg Vorbis audio stream.