A fair server adaptation algorithm for HTTP adaptive streaming using video complexity

Ran Dubin, Raffael Shalala, Amit Dvir, Ofir Pele, Ofer Hadar

    Research output: Contribution to journalArticlepeer-review

    3 Scopus citations

    Abstract

    The increasing popularity of online video content and adaptive video streaming services, especially those based on HTTP Adaptive Streaming (HAS) highlights the need for streaming optimization solutions. From a server perspective, the main drawback of HAS is that the user selects the quality of the next video segment without taking the server constraints into account. These constraints include the number of users simultaneously being served and the server’s congestion. Here, we present the Fair Server Adaptation (FSA) algorithm, which is designed to maximize user Quality of Experience (QoE) by tackling the server’s bottleneck problem. The algorithm provides the quality representation that is closest to the user’s request, subject to the server’s constraints. Simulation results show that compared to standard Dynamic Adaptive Streaming over HTTP (DASH) server, FSA increased the number of served users and decreased both the number of rebuffering events and the average rebuffering event duration. Furthermore, the average number of unserved users decreased to almost zero and Jain’s fairness index rose. It is clear that these changes increase users’ QoE.

    Original languageEnglish
    Pages (from-to)11203-11222
    Number of pages20
    JournalMultimedia Tools and Applications
    Volume78
    Issue number9
    DOIs
    StatePublished - 1 May 2019

    Keywords

    • Dynamic adaptive streaming over HTTP
    • Video streaming optimization

    ASJC Scopus subject areas

    • Software
    • Media Technology
    • Hardware and Architecture
    • Computer Networks and Communications

    Fingerprint

    Dive into the research topics of 'A fair server adaptation algorithm for HTTP adaptive streaming using video complexity'. Together they form a unique fingerprint.

    Cite this