Quality-adaptive Prefetching for Interactive Branched Video using - PowerPoint PPT Presentation

HTTP-based Adaptive Streaming (HAS) • HTTP-based streaming – Video is split into chunks – Easy firewall traversal and caching – Easy support for interactive VoD • HTTP-based adaptive streaming – Multiple encodings of each fragment (defined in manifest file) – Clients adapt quality encoding based on buffer/network conditions 34

HTTP-based Adaptive Streaming (HAS) Chunk1 • HTTP-based streaming – Video is split into chunks – Easy firewall traversal and caching – Easy support for interactive VoD • HTTP-based adaptive streaming – Multiple encodings of each fragment (defined in manifest file) – Clients adapt quality encoding based on buffer/network conditions 39

HTTP-based Adaptive Streaming (HAS) Chunk2 Chunk1 • HTTP-based streaming – Video is split into chunks – Easy firewall traversal and caching – Easy support for interactive VoD • HTTP-based adaptive streaming – Multiple encodings of each fragment (defined in manifest file) – Clients adapt quality encoding based on buffer/network conditions 40

HTTP-based Adaptive Streaming (HAS) Chunk2 Chunk3 Chunk1 • HTTP-based streaming – Video is split into chunks – Easy firewall traversal and caching – Easy support for interactive VoD • HTTP-based adaptive streaming – Multiple encodings of each fragment (defined in manifest file) – Clients adapt quality encoding based on buffer/network conditions 41

HTTP-based Adaptive Streaming (HAS) Chunk4 Chunk2 Chunk3 Chunk1 • HTTP-based streaming – Video is split into chunks – Easy firewall traversal and caching – Easy support for interactive VoD • HTTP-based adaptive streaming – Multiple encodings of each fragment (defined in manifest file) – Clients adapt quality encoding based on buffer/network conditions 42

HTTP-based Adaptive Streaming (HAS) Chunk5 Chunk4 Chunk2 Chunk3 Chunk1 • HTTP-based streaming – Video is split into chunks – Easy firewall traversal and caching – Easy support for interactive VoD • HTTP-based adaptive streaming – Multiple encodings of each fragment (defined in manifest file) – Clients adapt quality encoding based on buffer/network conditions 43

HTTP-based Adaptive Streaming (HAS) Chunk5 Chunk4 Chunk2 Chunk3 Chunk1 • HTTP-based streaming – Video is split into chunks – Easy firewall traversal and caching – Easy support for interactive VoD • HTTP-based adaptive streaming – Multiple encodings of each fragment (defined in manifest file) – Clients adapt quality encoding based on buffer/network conditions 44

HAS-based Interactive Branched Video • Branched video and branch points – The video can include branch points, with multiple branch choices – User selects which segment to play back next • Segments – Arbitrary sequence of chunks from one or more videos • Use of HAS allow adaptive prefetching – Goal: Seamless playback even if user decision at last possible moment 45

Contributions • We develop a simple analytic model which allows us to define the prefetching problem as an optimization problem – Maximizes expected playback quality while avoiding stalls • Based on our findings, we design optimized policies that determine: 1. When different chunks should be downloaded 2. What quality level should be selected for each of these chunks 3. How to manage playback buffers and (multiple) TCP connections such as to ensure smooth playback experience without excessive workahead (buffering) • The design and implementation of the framework • Experimental evaluation of our policies, which provide insights into the importance of careful adaptive policies

Contributions • We develop a simple analytic model which allows us to define the prefetching problem as an optimization problem – Maximizes expected playback quality while avoiding stalls • Based on our findings, we design optimized policies that determine: 1. When different chunks should be downloaded 2. What quality level should be selected for each of these chunks 3. How to manage playback buffers and (multiple) TCP connections such as to ensure smooth playback experience without excessive workahead (buffering) • The design and implementation * of the framework • Experimental evaluation of our policies, which provide insights into the importance of careful adaptive policies *Software: http://www.ida.liu.se/~nikca/mm14.html

Problem Description and Constraints • Problem: Maximize quality, given playback deadlines and bandwidth conditions

Problem Description and Constraints • Objective function playback quality

Problem Description and Constraints • Objective function

Problem Description and Constraints • Objective function Current segment

Problem Description and Constraints • Objective function Beginning of next segment

Problem Description and Constraints • Download order: round robin (optimal) Current segment

Problem Description and Constraints • Download order: round robin (optimal) Current segment first chunk next

Problem Description and Constraints • Download order: round robin (extra workahead) Current segment first chunk next extra workahead

Problem Description and Constraints • Once branch point has been traversed, move on to next segment ... Current segment first chunk next

Problem Description and Constraints Selected path • Once branch point has been traversed, move on to next segment ... Current segment first chunk next

Problem Description and Constraints Selected path • Once branch point has been traversed, move on to next segment ... current segment

Problem Description and Constraints • Once branch point has been traversed, move on to next segment ... current segment

Problem Description and Constraints • Once branch point has been traversed, move on to next segment ... 22 current segment first chunk next

Problem Description and Constraints Playback schedule • Playback deadlines – for seamless playback without stalls

Problem Description and Constraints Playback schedule Download schedule • Playback deadlines – for seamless playback without stalls

Problem Description and Constraints • Playback deadlines – for seamless playback without stalls – Current segment: e.g., 2 and 3

Problem Description and Constraints • Playback deadlines – for seamless playback without stalls – Current segment: e.g., 2 and 3 Download completion time

Problem Description and Constraints Download completion times • Playback deadlines – for seamless playback without stalls – Current segment: e.g., 2 and 3 Download completion time

Problem Description and Constraints Playback deadlines • Playback deadlines – for seamless playback without stalls – Current segment: e.g., 2 and 3 Time of playback deadline Download completion time

Problem Description and Constraints Playback deadlines • Playback deadlines – for seamless playback without stalls – Current segment: e.g., 2 and 3 Time of playback deadline

Problem Description and Constraints Playback deadlines • Playback deadlines – for seamless playback without stalls – Current segment: e.g., 2 and 3 Startup delay

Problem Description and Constraints Playback deadlines • Playback deadlines – for seamless playback without stalls – Current segment: e.g., 2 and 3 Playtime of earlier chunks Startup delay

Problem Description and Constraints • Playback deadlines – for seamless playback without stalls – First chunks next segment: e.g., 4, 7, and 10

Quality-adaptive Prefetching for Interactive Branched Video using - PowerPoint PPT Presentation

Quality-adaptive Prefetching for Interactive Branched Video using HTTP-based Adaptive Streaming Vengatanathan Krishnamoorthi 1 , Niklas Carlsson 1 , Derek Eager 2 , Anirban Mahanti 3 , Nahid Shahmehri 1 1 Linkping university, Sweden 2 University

1 Prefetching Implementations Recall Stream Buffer Diagram Sequential and stride prefetching

Prefetching Hyperlinks Prefetching Methods Prefetching Uncacheable/Dynamic Data

Adaptive Prefetching for Accelerating Read and Write in NVM-based File Systems Shengan Zheng ,

Interactive Branched Video Eric Lindskog, Jesper Wrang, Madeleine Bckstrm, Linn Hallonqvist,

Technologies for Web-based Adaptive Interactive Systems: Personalization Categories, and

COMP 590-154: Computer Architecture Prefetching Prefetching (1/3) Fetch block ahead of demand

Characterization of Branched Covers with Simplicial Branch Sets Eden Prywes University of

Collective Prefetching for Parallel I/O Systems Yong Chen and Philip C. Roth Oak Ridge National

Technologies for Web-based Adaptive Interactive Systems: User Modeling Factors, User Data

Graph Prefetching Using Data Structure Knowledge Sam Ainsworth and Timothy M. Jones Computer

Linux solution for prefetching necessary data during application and system startup Krzysztof

ADAPTIVE QUALITY ESTIMATION FOR MACHINE TRANSLATION AND AUTOMATIC SPEECH RECOGNITION Jos G. C.

3 rd Data Prefetching Championship June 23 rd , 2019 Held in conjunction with ISCA 2019 Seth

Branched harmonic functions and some related developments in differential geometry Simon

Adaptive Streaming of Interactive Free Viewpoint Videos to Heterogeneous Clients Ahmed Hamza 1 and

The geometry of the space of branched Rough Paths Nikolas Tapia 1 , joint work w. Lorenzo Zambotti

On Adaptive Strategies and Convex Optimization Algorithms Joon Kwon joint work with Panayotis

0 The first problem is of course speed: light transport is generally slow, transport in volumes

Anomaly Detection Fault Tolerance Anticipation Patterns John Allspaw SVP, Tech Ops Qcon

Stochastic gradient descent on Riemannian manifolds Silvre Bonnabel 1 Centre de Robotique -

3 Language Models 1: n -gram Language Models While the final goal of a statistical machine

A Nonlinear Contour Preserving Ward Van Aerschot Transform for Geometrical Image Compression

Notes Adams-Bashforth Adams-Bashforth family are examples of Notes for last part of Oct 11

Scheduling and queue management DigiComm II Traditional queuing behaviour in routers Data