# Optimal Network-Assisted Multi-user DASH Video Streaming

**Authors:** Emre Ozfatura, Ozgur Ercetin, Hazer Inaltekin

arXiv: 1703.03214 · 2018-01-01

## TL;DR

This paper introduces an optimal resource allocation policy at network edge servers for multi-user DASH video streaming, significantly reducing video stalling by scheduling users based on media deadlines.

## Contribution

It proposes and proves the optimality of a deadline-aware scheduling policy for minimizing video stalls in multi-user DASH streaming at network edges.

## Key findings

- Policy minimizes stalling probability in fixed loss rate networks.
- Simulation results confirm effectiveness under realistic conditions.
- Scheduling by deadlines improves streaming quality.

## Abstract

Streaming video is becoming the predominant type of traffic over the Internet with reports forecasting the video content to account for 80% of all traffic by 2019. With significant investment on Internet backbone, the main bottleneck remains at the edge servers (e.g., WiFi access points, small cells, etc.). In this work, we propose and prove the optimality of a multiuser resource allocation mechanism operating at the edge server that minimizes the probability of stalling of video streams due to buffer under-flows. Our proposed policy utilizes Media Presentation Description (MPD) files of clients that are sent in compliant to Dynamic Adaptive Streaming over HTTP (DASH) protocol to be cognizant of the deadlines of each of the media file to be displayed by the clients. Then, the policy schedules the users in the order of their deadlines. After establishing the optimality of this policy to minimize the stalling probability for a network with links associated with fixed loss rates, the utility of the algorithm is verified under realistic network conditions with detailed NS-3 simulations.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1703.03214/full.md

## Figures

26 figures with captions in the complete paper: https://tomesphere.com/paper/1703.03214/full.md

## References

59 references — full list in the complete paper: https://tomesphere.com/paper/1703.03214/full.md

---
Source: https://tomesphere.com/paper/1703.03214