Scalable Resilient Media Streaming

  • Published on

  • View

  • Download


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


Scalable Resilient Media StreamingSuman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind SrinivasanNOSSDAV 2004CS5248 Student PresentationApplication 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 networkCS5248 Student PresentationExamples Narada Builds a mesh, then a tree Everybody knows everybody High control overhead NICE Hierarchical clustering of nodes Low control overheadCS5248 Student PresentationNICECS5248 Student PresentationProblem Overlay network node failures Overlay network link failures Congestion failuresCS5248 Student PresentationSRMS ArchitectureMSARBYXMedia StreamJoin RequestAddress of SenderRequest DataDataStreaming ServerSRMS senderSRMS-RPSRMS clientSRMS clientCS5248 Student PresentationProbabilistic Resilient Multicast (PRM) Randomized Forwarding Triggered NAKsCS5248 Student PresentationRandomized 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 PresentationRandomized Forwarding (contd)ABDCFENMLGHQPOKJIXXCS5248 Student PresentationOverhead Analysisn : Total number of nodesr : Number of randomly forwarded nodes : Probability of random forwardingPer-node overhead of PRM: rCS5248 Student PresentationTriggered NAKsData losses due to link errors and network congestion are recovered using NAK-based retransmissions using the missing sequence numbers.CS5248 Student PresentationTriggered 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 retransmissionsCS5248 Student PresentationTriggered NAKs (contd)XYZSEQ: 18SEQ: 18NAK: 14, 15NAK: 1617 16 15 1417 16 15 1417 16 15 1417 16 15 1417 16 15 140011CS5248 Student PresentationExperimentsn : 10 10,000r : 1 - 3 : 0.01 0.03Compared PRM with Best-Effort (BE) methodsNomenclature: PRM b (r, )b bit mask used in NAK retransmissionsCS5248 Student PresentationEvaluations: Delivery RatioCS5248 Student PresentationEvaluations: Data LossCS5248 Student PresentationEvaluations: End-to-End LatencyCS5248 Student PresentationConclusions SRMS achieves high data distribution rates even with node and link failures Very low overhead Scales very wellCS5248 Student PresentationQ&ACS5248 Student Presentation


View more >