Stochastic Guarantees for Rate-Adaptive Streaming

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

External Research Organisations

  • Robert Bosch GmbH
View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018)
Subtitle of host publicationCo-located with the 30th International Teletraffic Congress, ITC 2018 and 1st International Conference in Networking Science and Practice
EditorsEitan Altman, Giuseppe Bianchi, Thomas Zinner
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages19-24
Number of pages6
ISBN (print)978-0-9883045-5-0
Publication statusPublished - 2018
Event2018 International Workshop on Network Calculus and Applications, NetCal2018 - Vienna, Austria
Duration: 3 Sept 20187 Sept 2018

Abstract

A major challenge in mobile video streaming applications is the variability of the wireless channel. Techniques like Apple's HLS and MPEG-DASH typically offer the video in chunks where each chunk is made available with different levels of quality and bitrate. Adaptive clients use estimates of the past network conditions to select the source bitrate of the next chunk accordingly. Frequently, this selection is based on the average performance and does not consider the variability of the channel. In this work, we present a method for bitrate adaptation that uses the distribution of the past throughput to provide statistical performance guarantees obtained by the stochastic network calculus. We show how to select the bitrate so that a certain, small probability of buffer underflow is not exceeded. Theoretical results are derived for the general case of an arbitrary throughput distribution. Numerical results are included for the example of a Gaussian distribution. Additionally, we present simulation results that show the relevant performance metrics like average bitrate and buffer level of a system that adjusts its bitrate as suggested by our method. Generally, the method presented in this paper can achieve a bitrate that is close to the average available throughput with little variability of the source bitrate, while limiting the probability of buffer underflow to a predefined level.

Keywords

    buffer underflow, de jitter buffer, MPEG-DASH, network calculus, rate-adaptive streaming, stochastic guarantees

ASJC Scopus subject areas

Cite this

Stochastic Guarantees for Rate-Adaptive Streaming. / Akselrod, Mark; Fidler, Markus; Lübben, Ralf.
Proceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018): Co-located with the 30th International Teletraffic Congress, ITC 2018 and 1st International Conference in Networking Science and Practice. ed. / Eitan Altman; Giuseppe Bianchi; Thomas Zinner. Institute of Electrical and Electronics Engineers Inc., 2018. p. 19-24 8493029.

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Akselrod, M, Fidler, M & Lübben, R 2018, Stochastic Guarantees for Rate-Adaptive Streaming. in E Altman, G Bianchi & T Zinner (eds), Proceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018): Co-located with the 30th International Teletraffic Congress, ITC 2018 and 1st International Conference in Networking Science and Practice., 8493029, Institute of Electrical and Electronics Engineers Inc., pp. 19-24, 2018 International Workshop on Network Calculus and Applications, NetCal2018, Vienna, Austria, 3 Sept 2018. https://doi.org/10.1109/itc30.2018.10056
Akselrod, M., Fidler, M., & Lübben, R. (2018). Stochastic Guarantees for Rate-Adaptive Streaming. In E. Altman, G. Bianchi, & T. Zinner (Eds.), Proceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018): Co-located with the 30th International Teletraffic Congress, ITC 2018 and 1st International Conference in Networking Science and Practice (pp. 19-24). Article 8493029 Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/itc30.2018.10056
Akselrod M, Fidler M, Lübben R. Stochastic Guarantees for Rate-Adaptive Streaming. In Altman E, Bianchi G, Zinner T, editors, Proceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018): Co-located with the 30th International Teletraffic Congress, ITC 2018 and 1st International Conference in Networking Science and Practice. Institute of Electrical and Electronics Engineers Inc. 2018. p. 19-24. 8493029 doi: 10.1109/itc30.2018.10056
Akselrod, Mark ; Fidler, Markus ; Lübben, Ralf. / Stochastic Guarantees for Rate-Adaptive Streaming. Proceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018): Co-located with the 30th International Teletraffic Congress, ITC 2018 and 1st International Conference in Networking Science and Practice. editor / Eitan Altman ; Giuseppe Bianchi ; Thomas Zinner. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 19-24
Download
@inproceedings{8de519fb783f4360a33424edac3cfe27,
title = "Stochastic Guarantees for Rate-Adaptive Streaming",
abstract = "A major challenge in mobile video streaming applications is the variability of the wireless channel. Techniques like Apple's HLS and MPEG-DASH typically offer the video in chunks where each chunk is made available with different levels of quality and bitrate. Adaptive clients use estimates of the past network conditions to select the source bitrate of the next chunk accordingly. Frequently, this selection is based on the average performance and does not consider the variability of the channel. In this work, we present a method for bitrate adaptation that uses the distribution of the past throughput to provide statistical performance guarantees obtained by the stochastic network calculus. We show how to select the bitrate so that a certain, small probability of buffer underflow is not exceeded. Theoretical results are derived for the general case of an arbitrary throughput distribution. Numerical results are included for the example of a Gaussian distribution. Additionally, we present simulation results that show the relevant performance metrics like average bitrate and buffer level of a system that adjusts its bitrate as suggested by our method. Generally, the method presented in this paper can achieve a bitrate that is close to the average available throughput with little variability of the source bitrate, while limiting the probability of buffer underflow to a predefined level.",
keywords = "buffer underflow, de jitter buffer, MPEG-DASH, network calculus, rate-adaptive streaming, stochastic guarantees",
author = "Mark Akselrod and Markus Fidler and Ralf L{\"u}bben",
note = "Funding Information: * This work was supported by the Soongsil University Research Fund.; 2018 International Workshop on Network Calculus and Applications, NetCal2018 ; Conference date: 03-09-2018 Through 07-09-2018",
year = "2018",
doi = "10.1109/itc30.2018.10056",
language = "English",
isbn = "978-0-9883045-5-0",
pages = "19--24",
editor = "Eitan Altman and Giuseppe Bianchi and Thomas Zinner",
booktitle = "Proceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018)",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Download

TY - GEN

T1 - Stochastic Guarantees for Rate-Adaptive Streaming

AU - Akselrod, Mark

AU - Fidler, Markus

AU - Lübben, Ralf

N1 - Funding Information: * This work was supported by the Soongsil University Research Fund.

PY - 2018

Y1 - 2018

N2 - A major challenge in mobile video streaming applications is the variability of the wireless channel. Techniques like Apple's HLS and MPEG-DASH typically offer the video in chunks where each chunk is made available with different levels of quality and bitrate. Adaptive clients use estimates of the past network conditions to select the source bitrate of the next chunk accordingly. Frequently, this selection is based on the average performance and does not consider the variability of the channel. In this work, we present a method for bitrate adaptation that uses the distribution of the past throughput to provide statistical performance guarantees obtained by the stochastic network calculus. We show how to select the bitrate so that a certain, small probability of buffer underflow is not exceeded. Theoretical results are derived for the general case of an arbitrary throughput distribution. Numerical results are included for the example of a Gaussian distribution. Additionally, we present simulation results that show the relevant performance metrics like average bitrate and buffer level of a system that adjusts its bitrate as suggested by our method. Generally, the method presented in this paper can achieve a bitrate that is close to the average available throughput with little variability of the source bitrate, while limiting the probability of buffer underflow to a predefined level.

AB - A major challenge in mobile video streaming applications is the variability of the wireless channel. Techniques like Apple's HLS and MPEG-DASH typically offer the video in chunks where each chunk is made available with different levels of quality and bitrate. Adaptive clients use estimates of the past network conditions to select the source bitrate of the next chunk accordingly. Frequently, this selection is based on the average performance and does not consider the variability of the channel. In this work, we present a method for bitrate adaptation that uses the distribution of the past throughput to provide statistical performance guarantees obtained by the stochastic network calculus. We show how to select the bitrate so that a certain, small probability of buffer underflow is not exceeded. Theoretical results are derived for the general case of an arbitrary throughput distribution. Numerical results are included for the example of a Gaussian distribution. Additionally, we present simulation results that show the relevant performance metrics like average bitrate and buffer level of a system that adjusts its bitrate as suggested by our method. Generally, the method presented in this paper can achieve a bitrate that is close to the average available throughput with little variability of the source bitrate, while limiting the probability of buffer underflow to a predefined level.

KW - buffer underflow

KW - de jitter buffer

KW - MPEG-DASH

KW - network calculus

KW - rate-adaptive streaming

KW - stochastic guarantees

UR - http://www.scopus.com/inward/record.url?scp=85057194975&partnerID=8YFLogxK

U2 - 10.1109/itc30.2018.10056

DO - 10.1109/itc30.2018.10056

M3 - Conference contribution

AN - SCOPUS:85057194975

SN - 978-0-9883045-5-0

SP - 19

EP - 24

BT - Proceedings of the 2018 International Workshop on Network Calculus and Applications (NetCal2018)

A2 - Altman, Eitan

A2 - Bianchi, Giuseppe

A2 - Zinner, Thomas

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2018 International Workshop on Network Calculus and Applications, NetCal2018

Y2 - 3 September 2018 through 7 September 2018

ER -

By the same author(s)