1 / 20

On the Interactions Between Layered Quality Adaptation and Congestion Control for Streaming Video

On the Interactions Between Layered Quality Adaptation and Congestion Control for Streaming Video. 11 th International Packet Video Workshop Nick Feamster Deepak Bansal Hari Balakrishnan MIT Laboratory for Computer Science http://nms.lcs.mit.edu/projects/videocm/. Not Like Watching TV!.

chenoa
Download Presentation

On the Interactions Between Layered Quality Adaptation and Congestion Control for Streaming Video

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. On the Interactions Between Layered Quality Adaptation and Congestion Control for Streaming Video 11th International Packet Video Workshop Nick Feamster Deepak Bansal Hari Balakrishnan MIT Laboratory for Computer Science http://nms.lcs.mit.edu/projects/videocm/

  2. Not Like Watching TV! MIT Laboratory for Computer Science

  3. Why Is This Happening? • The Internet poses several problems for the delivery of data • Variable Bandwidth • Variable Delay • Packet Loss • Very detrimental to interactive video delivery • How do we transmit video on the Internet in the face of varying bandwidth? MIT Laboratory for Computer Science

  4. Request for Video Streaming Video Loss/Latency Feedback Video Server Video Client System Context • This talk is aboutbandwidth adaptation • Conclusion: The combination of smooth congestion control and clever receiver buffering can overcome the evils of bandwidth variation! Streaming Video MIT Laboratory for Computer Science

  5. Bandwidth Adaptation • Available bandwidth varies with time • Servers should adapt to varying bandwidth • Congestion Control: Transmission rate must • correspond to available bandwidth • be TCP-friendly • Quality Adaptation: Quality of video should correspond to transmission rate • Limited capacity for buffering! MIT Laboratory for Computer Science

  6. Layered Video • Simulcast: Each layer is independent • Hierarchical: Higher depends on lower • Base/Enhancement layers • Linear granularity (C bits/layer) Hierarchical Layering Simulcast Layering MIT Laboratory for Computer Science

  7. Binomial Congestion Control Exponential Backoff w(t) AIMD • Trade-off between increase aggressiveness and decrease magnitude • K+L=1 implies TCP-friendly [Bansal, INFOCOM 2001] • SQRT has a modest backoff (~R1/2) => attractive for streaming media t MIT Laboratory for Computer Science

  8. AIMD SQRT Bitrate Bitrate Reduced Oscillations In many cases, AIMD drops multiple layers in one backoff! This is not the case with SQRT. Rate oscillations in SQRT are much less pronounced than in AIMD. MIT Laboratory for Computer Science

  9. Layered Quality Adaptation • Tailor video to available bandwidth! • Can be immediate or receiver-buffered • Rejaie et al., SIGCOMM ‘99 MIT Laboratory for Computer Science

  10. Consumption Rate (na+1)C C Optimal L0 buffering Receiver Buffering R Buffer Filling • Allocate more buffer space to lower layers • Add a layer when the following conditions are met: • Enough bandwidth is available • Enough video is buffered to sustain a backoff and continue playing all of the layers (including the new layer) Buffer Draining R/2 MIT Laboratory for Computer Science

  11. Interaction of SQRT and QA: We Win! • With SQRT: • Smaller Oscillations • Less buffering required for quality adaptation R Consumption Rate (na+1)C C Total buffering to add an additional layer is O(R3/2) rather than O(R2) R – bR1/2 MIT Laboratory for Computer Science

  12. Reduced Buffering 56% less buffering to add 4 layers SQRT requires less buffering to add layers! MIT Laboratory for Computer Science

  13. Conclusion • Combination of SQRT congestion control with receiver quality adaptation enables smooth video delivery • Reduces rate oscillations • Reduces buffering/Increases interactivity • Software is available • Includes selective reliability for packet loss • http://nms.lcs.mit.edu/software/videocm/ MIT Laboratory for Computer Science

  14. Extra Slides MIT Laboratory for Computer Science

  15. Outline • Problem Overview • Background • Bandwidth Variation • Quality Adaptation • Binomial Congestion Control • Approach • Results • Conclusion MIT Laboratory for Computer Science

  16. The Goal • TCP-friendly congestion control • Reduce rate oscillations: • Limit size of playout buffer • Smooth perceptual quality • Limit receiver buffering for QA • Reach acceptable playout rate faster • More interactivity in certain cases (i.e., if RTT and RTT jitter are small) MIT Laboratory for Computer Science

  17. Results of SQRT • Tested on emulated network conditions with Dummynet and SURGE toolkit • SQRT reduces rate oscillations for: • Immediate adaptation • Receiver-buffered QA • Also reduces buffering: • Less jitter due to rate oscillations • Backoffs less severe => less QA buffering • Can play out at higher layers more quickly • More interactivity MIT Laboratory for Computer Science

  18. RTSP MPEG Server MPEG Client loss/RTT callbacks data loss/RTT/requests data loss/RTT/requests Internet SR-RTP RTP/RTCP RTP/RTCP CM MIT Laboratory for Computer Science

  19. Layering callbacks RTP/RTCP RTP/RTCP RTSP MPEG Server MPEG Client Internet callbacks data loss/RTT loss/RTT/requests data loss/RTT/requests SR-RTP System Architecture Bandwidth Adaptation CM MIT Laboratory for Computer Science

  20. Layers Dropped AIMD SQRT Bitrate Bitrate Reduced Oscillations In many cases, AIMD drops multiple layers in one backoff! This is not the case with SQRT. Rate oscillations in SQRT are much less pronounced than in AIMD. MIT Laboratory for Computer Science

More Related