Should I stay or should I go: Analysis of the impact of application QoS on user engagement in YouTube

Maria Plakia; Evripides Tzamousis; Thomais Asvestopoulou; Giorgos Pantermakis; Nick Filippakis; Henning Schulzrinne; Yana Kane-Esrig; Maria Papadopouli

arXiv · 1901.01603

Should I stay or should I go: Analysis of the impact of application QoS on user engagement in YouTube

Maria Plakia·Evripides Tzamousis·Thomais Asvestopoulou·Giorgos Pantermakis·Nick Filippakis·Henning Schulzrinne·Yana Kane-Esrig·Maria Papadopouli

View original source ↗Read source document ↗Export metadata ↓

Abstract

To improve the quality of experience (QoE), especially under moderate to high traffic demand, it is important to understand the impact of the network and application QoS on user experience. This paper comparatively evaluates the impact of impairments, their intensity and temporal dynamics, on user engagement in the context of video streaming. The analysis employed two large YouTube datasets. To characterize the user engagement and the impact of impairments, several new metrics were defined. We assessed whether or not there is a statistically significant relationship between different types of impairments and QoE and user engagement metrics, taking into account not only the characteristics of the impairments but also the covariates of the session (e.g., video duration, mean datarate). After observing the relationships across the entire dataset, we tested whether these relationships also persist under specific conditions with respect to the covariates. The introduction of several new metrics and of various covariates in the analysis are two innovative aspects of this work. We found that the number of negative bitrate changes (BR-) is a stronger predictor of abandonment than rebufferrings (RB). Even positive bitrate changes (BR+) are associated with increases in abandonment. Specifically, BR+ in low resolution sessions is not well received. Temporal dynamics of the impairments have also an impact: a BR- that follows much later a RB appears to be perceived as a worse impairment than a BR- that occurs immediately after a RB. These results can be used to guide the design of the video streaming adaptation as well as suggest which parameters should be varied in controlled field studies.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Maria Plakia, Evripides Tzamousis, Thomais Asvestopoulou, Giorgos Pantermakis, Nick Filippakis, Henning Schulzrinne, Yana Kane-Esrig, Maria Papadopouli. 2019-03-15. Should I stay or should I go: Analysis of the impact of application QoS on user engagement in YouTube. https://arxiv.org/abs/1901.01603

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Formal Abstractions for Packet Scheduling

Early programming models for software-defined networking (SDN) focused on basic features for controlling network-wide forwarding paths, but more recent work has considered richer features, such as packet scheduling and queueing, that affect performance. In particular, PIFO trees, proposed by Sivaraman et al., offer a flexible and efficient primitive for programmable packet scheduling. Prior work has shown that PIFO trees can express a wide range of practical algorithms including strict priority, weighted fair queueing, and hierarchical schemes. However, the semantic properties of PIFO trees are not well understood. This paper studies PIFO trees from a programming language perspective. We formalize the syntax and semantics of PIFO trees in an operational model that decouples the scheduling policy running on a tree from the topology of the tree. Building on this formalization, we develop compilation algorithms that allow the behavior of a PIFO tree written against one topology to be realized using a tree with a different topology. Such a compiler could be used to optimize an implementation of PIFO trees, or realize a logical PIFO tree on a target with a fixed topology baked into the hardware. To support experimentation, we develop a software simulator for PIFO trees, and we present case studies illustrating its behavior on standard and custom algorithms.

cs.NI↗

arXiv2026

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI↗

arXiv2026

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI↗