Dynamic priority-based resource provisioning for video transcoding with heterogeneous QoS

Video transcoding is widely adopted in online video services to transcode videos into multiple representations for dynamic adaptive bitrate streaming. This solution may consume significant resources and incur intolerable processing delays. Meanwhile, different videos have different quality-of-servic...

Full description

Saved in:
Bibliographic Details
Main Authors: Gao, Guanyu, Wen, Yonggang, Westphal, Cedric
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/142288
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:Video transcoding is widely adopted in online video services to transcode videos into multiple representations for dynamic adaptive bitrate streaming. This solution may consume significant resources and incur intolerable processing delays. Meanwhile, different videos have different quality-of-service (QoS) requirements for transcoding. Delay-sensitive videos must be transcoded within a strict deadline, whereas delay-tolerant videos are not required to be transcoded immediately. Some intelligent policies are required for provisioning the right amount of resources in the transcoding system to meet the heterogeneous QoS requirements, especially under dynamic workloads. To this end, we develop a robust dynamic priority-based resource provisioning scheme for video transcoding. We adopt the preemptive resume priority discipline to design a multiple-priority transcoding mechanism. The system performs the transcoding for delay-tolerant videos by utilizing idle resources for improving resource utilization while not affecting the transcoding for delay-sensitive videos. We adopt the model predictive control framework to design an online algorithm for dynamic resource provisioning to accommodate time-varying workloads by predicting future workloads. To seek performance robustness against prediction noise, we improve the performance of our online algorithm via robust design. The experimental results demonstrate that our proposed method can satisfy the heterogeneous QoS requirements while significantly reducing computing resource consumption.