Delay-Power-Rate-Distortion Optimization of Video Representations for Dynamic Adaptive Streaming

• Published in: IEEE transactions on circuits and systems for video technology Vol. 28; no. 7; pp. 1648 - 1664
• Main Authors: Li, Chenglin, Toni, Laura, Zou, Junni, Xiong, Hongkai, Frossard, Pascal
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.07.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Codes; Coding; Computer simulation; Delay; delay-power-rate-distortion; Delays; Dynamic adaptive video streaming; Greedy algorithms; live video; Optimization; Parameters; Power demand; representation selection; Representations; Servers; Source coding; Streaming media; submodular function maximization; Upper bounds; User satisfaction; Video data; Video transmission
• ISSN: 1051-8215; 1558-2205; 1558-2205
• DOI: 10.1109/TCSVT.2017.2681024

Dynamic adaptive streaming addresses user heterogeneity by providing multiple encoded representations at different rates and/or resolutions for the same video content. For delay-sensitive applications, such as live streaming, there is however a stringent requirement on the encoding delay, and usually the encoding power (or rate) budget is also limited by the computational (or storage) capacity of the server. It is therefore important, yet challenging, to optimally select the source coding parameters for each encoded representation in order to minimize the resource consumption while maintaining a high quality of experience for the users. To address this, we propose an optimization framework with an optimal representation selection problem for delay, power, and rate constrained adaptive video streaming. Then, by the optimal selection of source coding parameters for each selected representation, we maximize the overall expected user satisfaction, subject not only to the encoding rate constraint, but also to the delay and power constraints at the server. We formulate the proposed optimization problem as an integer linear program formulation to provide the performance upper bound, and as a submodular maximization problem with two knapsack constraints to develop a practically feasible algorithm. Simulation results show that the proposed weighted rate and power cost benefit greedy algorithm is able to achieve a near-optimal performance with very low time complexity. In addition, it can strike the best tradeoff both between the rate and power cost, and between the algorithm's performance and the delay requirements proposed by delay sensitive applications.