Literature Database Entry


Martin Dräxler, Johannes Blobel, Philipp Dreimann, Stefan Valentin and Holger Karl, "SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming," Proceedings of International Conference on Networked Systems (NetSys 2015), Cottbus, Germany, March 2015, pp. 1–8.


Video streaming is in high demand by mobile users. In cellular networks, however, the unreliable wireless channel leads to two major problems. Poor channel states degrade video quality and interrupt the playback when a user cannot sufficiently fill its local playout buffer: buffer underruns occur. In contrast, good channel conditions cause common greedy buffering schemes to buffer too much data. Such over-buffering wastes expensive wireless channel capacity. Assuming that we can anticipate future data rates, we plan the quality and download time of video segments ahead. This anticipatory download scheduling avoids buffer underruns by downloading a large number of segments before a drop in available data rate occurs, without wasting wireless capacity by excessive buffering. We developed a practical anticipatory scheduling algorithm for segmented video streaming protocols (e.g., HLS or MPEG DASH). Simulation results and testbed measurements show that our solution essentially eliminates playback interruptions without significantly decreasing video quality.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Martin Dräxler
Johannes Blobel
Philipp Dreimann
Stefan Valentin
Holger Karl

BibTeX reference

    author = {Dr{\"{a}}xler, Martin and Blobel, Johannes and Dreimann, Philipp and Valentin, Stefan and Karl, Holger},
    doi = {10.1109/NetSys.2015.7089073},
    title = {{SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming}},
    pages = {1--8},
    publisher = {IEEE},
    address = {Cottbus, Germany},
    booktitle = {International Conference on Networked Systems (NetSys 2015)},
    month = {3},
    year = {2015},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.