CBA: Contextual Quality Adaptation for Adaptive Bitrate Video Streaming

Abstract

Recent advances in quality adaptation algorithms leave adaptive bitrate (ABR) streaming architectures at a crossroads: When determining the sustainable video quality one may either rely on the information gathered at the client vantage point or on server and network assistance. The fundamental problem here is to determine how valuable either information is for the adaptation decision. This problem becomes particularly hard in future Internet settings such as Named Data Networking (NDN) where the notion of a network connection does not exist.In this paper, we provide a fresh view on ABR quality adaptation for QoE maximization, which we formalize as a decision problem under uncertainty, and for which we contribute a sparse Bayesian contextual bandit algorithm denoted CBA. This allows taking high-dimensional streaming context information, including client-measured variables and network assistance, to find online the most valuable information for the quality adaptation. Since sparse Bayesian estimation is computationally expensive, we develop a fast new inference scheme to support online video adaptation. We perform an extensive evaluation of our adaptation algorithm in the particularly challenging setting of NDN, where we use an emulation testbed to demonstrate the efficacy of CBA compared to state-of-the-art algorithms.

EdgeBOL: A Bayesian Learning Approach for the Joint Orchestration of vRANs and Mobile Edge AI

“…In this paper, we propose a fundamentally different approach for controlling the virtualized Base Station (vBS) and the edge server, as it relies on Bayesian contextual bandit algorithms. Such techniques have been employed to adjust video streaming in mobile networks [34], to minimize the power consumption in vBS [35], to optimize BS handovers [36], and to control mmWave networks [37]. Perhaps the most closely related work to ours is [12], which assigns CPU time to virtualized BSs, but this focuses on data transfers (not accuracy or end-to-end latency).…”

Energy-Aware Scheduling of Virtualized Base Stations in O-RAN with Online Learning

“…Following an akin approach, contextual bandit algorithms have been employed to decide video streaming rates [16] or BS handover thresholds [17]; assign Central Processing Unit (CPU) time to virtualized BSs [18]; and control millimeter Wave (mmWave) networks [19]. These works require contextrelated information (e.g., about network conditions and traffic), which shapes the performance functions, to be known before the system is configured.…”