Scalable Resilient Media Streaming

  • Published on
    15-Jan-2016

  • View
    31

  • Download
    0

Embed Size (px)

DESCRIPTION

Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan NOSSDAV 2004. Scalable Resilient Media Streaming. Application Layer Multicast. Multicast forwarding at end-hosts Construct an overlay network. Advantages No change in network infrastructure - PowerPoint PPT Presentation

Transcript

  • Scalable Resilient Media StreamingSuman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind SrinivasanNOSSDAV 2004

    CS5248 Student Presentation

  • Application Layer Multicast Advantages No change in network infrastructure Applications have full control Disadvantages Stretch and Stress Control data overhead

    Multicast forwarding at end-hosts Construct an overlay network

    CS5248 Student Presentation

  • Examples Narada Builds a mesh, then a tree Everybody knows everybody High control overhead NICE Hierarchical clustering of nodes Low control overhead

    CS5248 Student Presentation

  • NICE

    CS5248 Student Presentation

  • Problem Overlay network node failures Overlay network link failures Congestion failures

    CS5248 Student Presentation

  • SRMS ArchitectureMSARBYXMedia StreamJoin RequestAddress of SenderRequest DataDataStreaming ServerSRMS senderSRMS-RPSRMS clientSRMS client

    CS5248 Student Presentation

  • Probabilistic Resilient Multicast (PRM) Randomized Forwarding Triggered NAKs

    CS5248 Student Presentation

  • Randomized ForwardingEach node in the overlay network forwards the data to a constant number of other overlay nodes with a low probability (0.010.03)

    CS5248 Student Presentation

  • Randomized Forwarding (contd)ABDCFENMLGHQPOKJIXX

    CS5248 Student Presentation

  • Overhead Analysisn : Total number of nodesr : Number of randomly forwarded nodes : Probability of random forwardingPer-node overhead of PRM: r

    CS5248 Student Presentation

  • Triggered NAKsData losses due to link errors and network congestion are recovered using NAK-based retransmissions using the missing sequence numbers.

    CS5248 Student Presentation

  • Triggered NAKs (contd)Each node piggybacks a bit mask with every forwarded packet indicating the prior sequence numbers it has correctly receivedRecipient of the data packet detects missing packets using the gaps in the received sequence and requests appropriate retransmissions

    CS5248 Student Presentation

  • Triggered NAKs (contd)XYZSEQ: 18SEQ: 18NAK: 14, 15NAK: 1617 16 15 1417 16 15 1417 16 15 1417 16 15 1417 16 15 14

    0011

    CS5248 Student Presentation

  • Experimentsn : 10 10,000r : 1 - 3 : 0.01 0.03Compared PRM with Best-Effort (BE) methods

    Nomenclature: PRM b (r, )

    b bit mask used in NAK retransmissions

    CS5248 Student Presentation

  • Evaluations: Delivery Ratio

    CS5248 Student Presentation

  • Evaluations: Data Loss

    CS5248 Student Presentation

  • Evaluations: End-to-End Latency

    CS5248 Student Presentation

  • Conclusions SRMS achieves high data distribution rates even with node and link failures Very low overhead Scales very well

    CS5248 Student Presentation

  • Q&A

    CS5248 Student Presentation

Recommended

View more >