An optimal scheduling algorithm for DASH video streaming over variable bit rate networks
by Shin-Hung Chang; Kuan-Jen Wang; Jan-Ming Ho
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 34, No. 2, 2020

Abstract: With the rapid increase of network bandwidth, it becomes popular for people to watch video over the internet. To cope with dynamic and heterogeneous network condition, commercial service providers use DASH streaming technology to serve contents to their users. Under the limited bandwidth constraint, previous scheduling algorithms usually arrange as many as possible highest-resolution segments in a DASH streaming service. However, scheduling the most highest-resolution segments will lead to arrange the most lowest-resolution segments in this streaming service simultaneously. In this paper, we address that improving the whole video streaming quality should start from the key concept of scheduling minimum number of low resolution segments iteratively. We define an M-Low optimisation problem and propose a novel M-Low scheduling algorithm, which adjusts the video resolution and optimises the QoE indices in a DASH streaming service. Moreover, we show through simulations that our proposed MLow scheduling achieves a higher QoE measures than those of previously published algorithms.

Online publication date: Mon, 22-Jun-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com