Proceedings of the 3rd Multimedia Systems Conference 2012
DOI: 10.1145/2155555.2155580
|View full text |Cite
|
Sign up to set email alerts
|

Quality selection for Dynamic Adaptive Streaming over HTTP with Scalable Video Coding

Abstract: Video streaming on the Internet is increasingly using Dynamic Adaptive Streaming over HTTP (DASH), which allows a client to dynamically adjust its video quality by choosing the appropriate quality level for each segment based on the current download rate. In this paper we examine the impact of Scalable Video Coding (SVC) on the client's quality selection policy. Given a variable download rate, when should the client try to maximize the current segment's video quality, and when should it instead play it safe an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
45
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(46 citation statements)
references
References 8 publications
1
45
0
Order By: Relevance
“…The evolution of the variable bw k is modeled as a first-order discrete-time Markov chain, simulating the throughput changes in a real environment [6]. The proposed chain is made up of the M discrete bandwidth values for bw k and has a channel state-remaining probability of 0.8, whereas the transition probability to other channel states is 0.1 each.…”
Section: Stochastic Dynamic Programming Algorithmmentioning
confidence: 99%
“…The evolution of the variable bw k is modeled as a first-order discrete-time Markov chain, simulating the throughput changes in a real environment [6]. The proposed chain is made up of the M discrete bandwidth values for bw k and has a channel state-remaining probability of 0.8, whereas the transition probability to other channel states is 0.1 each.…”
Section: Stochastic Dynamic Programming Algorithmmentioning
confidence: 99%
“…Note that despite improvements, the performance differences between the full cache policy (best case) and empty cache policy (worst case) are relatively small. 4 This suggests that proxies, regardless of policy, can provide only very limited performance advantages in the case the client-proxy link is the bottleneck.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…In contrast, the basic best effort policy performs very similar to 4 To make sure that the small performance improvements were not due to optimizations made at the server we took a closer look at the service times of individual fragments, when served by the server or the (full) proxy cache respectively. In fact, for the case with the same RTT to both the server and the proxy, we observed a smaller time to first byte (x = 8.30ms; σ = 15.03ms) for the full cache than for the server (x = 16.10ms; σ = 7.85ms).…”
Section: Performance Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…A number of studies have suggested enhancements to DASH, including novel rate adaptation algorithms [5]- [7], methods for determining optimal segment duration [8], extensions to SVC video [9]- [11], peer-assisted delivery of DASH video [12], and the addition of QoE-aware proxies in the content delivery network to improve DASH performance [13]- [15]. Others have considered the problem of delivering DASH video at an acceptable quality over wireless networks, but with respect to aggregate cell performance rather than the experience of an individual user [16], [17].…”
Section: Related Workmentioning
confidence: 99%