Chunk Size Aware Buffer-Based Algorithm to Improve Viewing Experience in Dynamic HTTP Streaming

Waqas ur RAHMAN; Kwangsue CHUNG

doi:10.1587/transcom.2015EBP3398

Chunk Size Aware Buffer-Based Algorithm to Improve Viewing Experience in Dynamic HTTP Streaming

Waqas ur RAHMAN, Kwangsue CHUNG

Full Text Views

0

Share
Cite this

Summary :

In this paper we propose an adaptive bitrate (ABR) algorithm that selects the video rates by observing and controlling the playback buffer. In a Hypertext Transfer Protocol (HTTP) adaptive streaming session, buffer dynamics largely depend on the chunk sizes. First, we present the algorithm that selects the next video rates based on the current buffer level, while considering the upcoming chunk sizes. We aim to exploit the variation of chunk sizes of a variable bitrate (VBR) encoded video to optimize the tradeoff between the video rate and buffer underflow events while keeping a low frequency of video rate changes. To evaluate the performance of the proposed algorithm, we consider three scenarios: (i) the video flow does not compete with any cross traffic, (ii) the video flow shares the bottleneck link with competing TCP traffic, and (iii) two HTTP clients share the bottleneck. We show that the proposed algorithm selects a high playback video rate and avoids unnecessary rebuffering while keeping a low frequency of video rate changes. Furthermore, we show that the proposed algorithm changes the video quality gradually to guarantee the user's viewing experience.

Publication: IEICE TRANSACTIONS on Communications Vol.E99-B No.3 pp.767-775

Publication Date: 2016/03/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2015EBP3398

Type of Manuscript: PAPER

Category: Multimedia Systems for Communications

Authors

Waqas ur RAHMAN
Kwangwoon University
Kwangsue CHUNG
Kwangwoon University

Keyword

rate adaptation, quality adaptation, quality of experience, seamless video streaming, video streaming scheme

Cite this

Copy

Waqas ur RAHMAN, Kwangsue CHUNG, "Chunk Size Aware Buffer-Based Algorithm to Improve Viewing Experience in Dynamic HTTP Streaming" in IEICE TRANSACTIONS on Communications, vol. E99-B, no. 3, pp. 767-775, March 2016, doi: 10.1587/transcom.2015EBP3398.
Abstract: In this paper we propose an adaptive bitrate (ABR) algorithm that selects the video rates by observing and controlling the playback buffer. In a Hypertext Transfer Protocol (HTTP) adaptive streaming session, buffer dynamics largely depend on the chunk sizes. First, we present the algorithm that selects the next video rates based on the current buffer level, while considering the upcoming chunk sizes. We aim to exploit the variation of chunk sizes of a variable bitrate (VBR) encoded video to optimize the tradeoff between the video rate and buffer underflow events while keeping a low frequency of video rate changes. To evaluate the performance of the proposed algorithm, we consider three scenarios: (i) the video flow does not compete with any cross traffic, (ii) the video flow shares the bottleneck link with competing TCP traffic, and (iii) two HTTP clients share the bottleneck. We show that the proposed algorithm selects a high playback video rate and avoids unnecessary rebuffering while keeping a low frequency of video rate changes. Furthermore, we show that the proposed algorithm changes the video quality gradually to guarantee the user's viewing experience.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.2015EBP3398/_p

Copy

@ARTICLE{e99-b_3_767,
author={Waqas ur RAHMAN, Kwangsue CHUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Chunk Size Aware Buffer-Based Algorithm to Improve Viewing Experience in Dynamic HTTP Streaming},
year={2016},
volume={E99-B},
number={3},
pages={767-775},
abstract={In this paper we propose an adaptive bitrate (ABR) algorithm that selects the video rates by observing and controlling the playback buffer. In a Hypertext Transfer Protocol (HTTP) adaptive streaming session, buffer dynamics largely depend on the chunk sizes. First, we present the algorithm that selects the next video rates based on the current buffer level, while considering the upcoming chunk sizes. We aim to exploit the variation of chunk sizes of a variable bitrate (VBR) encoded video to optimize the tradeoff between the video rate and buffer underflow events while keeping a low frequency of video rate changes. To evaluate the performance of the proposed algorithm, we consider three scenarios: (i) the video flow does not compete with any cross traffic, (ii) the video flow shares the bottleneck link with competing TCP traffic, and (iii) two HTTP clients share the bottleneck. We show that the proposed algorithm selects a high playback video rate and avoids unnecessary rebuffering while keeping a low frequency of video rate changes. Furthermore, we show that the proposed algorithm changes the video quality gradually to guarantee the user's viewing experience.},
keywords={},
doi={10.1587/transcom.2015EBP3398},
ISSN={1745-1345},
month={March},}

Copy

TY - JOUR
TI - Chunk Size Aware Buffer-Based Algorithm to Improve Viewing Experience in Dynamic HTTP Streaming
T2 - IEICE TRANSACTIONS on Communications
SP - 767
EP - 775
AU - Waqas ur RAHMAN
AU - Kwangsue CHUNG
PY - 2016
DO - 10.1587/transcom.2015EBP3398
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E99-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2016
AB - In this paper we propose an adaptive bitrate (ABR) algorithm that selects the video rates by observing and controlling the playback buffer. In a Hypertext Transfer Protocol (HTTP) adaptive streaming session, buffer dynamics largely depend on the chunk sizes. First, we present the algorithm that selects the next video rates based on the current buffer level, while considering the upcoming chunk sizes. We aim to exploit the variation of chunk sizes of a variable bitrate (VBR) encoded video to optimize the tradeoff between the video rate and buffer underflow events while keeping a low frequency of video rate changes. To evaluate the performance of the proposed algorithm, we consider three scenarios: (i) the video flow does not compete with any cross traffic, (ii) the video flow shares the bottleneck link with competing TCP traffic, and (iii) two HTTP clients share the bottleneck. We show that the proposed algorithm selects a high playback video rate and avoids unnecessary rebuffering while keeping a low frequency of video rate changes. Furthermore, we show that the proposed algorithm changes the video quality gradually to guarantee the user's viewing experience.
ER -