TY - JOUR
T1 - Optimal network-assisted multiuser DASH video streaming
AU - Ozfatura, Emre
AU - Ercetin, Ozgur
AU - Inaltekin, Hazer
PY - 2018/6
Y1 - 2018/6
N2 - Streaming video is becoming the predominant type of traffic over the Internet with reports forecasting the video content to account for 82% of all traffic by 2021. With significant investment on Internet backbone, the main bottleneck remains at the edge servers (e.g., WiFi access points, small cells, etc.). In this paper, we obtain 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 derived policy utilizes media presentation description files of clients that are sent in compliant to dynamic adaptive streaming over HTTP protocol to be cognizant of the deadlines of each of the media file to be displayed by the clients. Our policy allocates the available channel resources to the users, in a time division manner, 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.
AB - Streaming video is becoming the predominant type of traffic over the Internet with reports forecasting the video content to account for 82% of all traffic by 2021. With significant investment on Internet backbone, the main bottleneck remains at the edge servers (e.g., WiFi access points, small cells, etc.). In this paper, we obtain 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 derived policy utilizes media presentation description files of clients that are sent in compliant to dynamic adaptive streaming over HTTP protocol to be cognizant of the deadlines of each of the media file to be displayed by the clients. Our policy allocates the available channel resources to the users, in a time division manner, 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.
UR - http://www.scopus.com/inward/record.url?scp=85045750322&partnerID=8YFLogxK
U2 - 10.1109/TBC.2018.2823644
DO - 10.1109/TBC.2018.2823644
M3 - Article
AN - SCOPUS:85045750322
SN - 0018-9316
VL - 64
SP - 247
EP - 265
JO - IEEE Transactions on Broadcasting
JF - IEEE Transactions on Broadcasting
IS - 2
ER -