The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
An experimental evaluation of rate-adaptation algorithms in adaptive streaming over HTTP
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
On the impact of quality adaptation in SVC-based P2P video-on-demand systems
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
iDASH: improved dynamic adaptive streaming over HTTP using scalable video coding
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
Layered quality adaptation for Internet video streaming
IEEE Journal on Selected Areas in Communications
Overview of fine granularity scalability in MPEG-4 video standard
IEEE Transactions on Circuits and Systems for Video Technology
Overview of the Scalable Video Coding Extension of the H.264/AVC Standard
IEEE Transactions on Circuits and Systems for Video Technology
QoE optimization through in-network quality adaptation for HTTP adaptive streaming
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
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 and ensure a minimum level of quality for future segments? We use a combination of analysis, dynamic programming, and simulation to show that a client should use a diagonal quality selection policy, which combines prefetching with backfilling to balance both of these concerns. We also illustrate the conditions that affect the slope of the diagonal policy.