DOC PREVIEW
UMBC CMSC 691 - Receiver-driven Layered Multicast

This preview shows page 1-2-15-16-31-32 out of 32 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 32 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 32 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 32 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 32 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 32 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 32 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 32 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Receiver-driven Layered MulticastOverviewIntroductionApproaches to Rate-Adaptive MultimediaExample of HeterogeneityIssues and ChallengesLayered ApproachSlide 8Issue in Layered ApproachRLM – Network ModelRLM - Video StreamsRLM SessionsRouter MechanismsRLM - ProtocolRLM – Adding and Dropping layersSlide 16RLM – Join ExperimentsRLM Join ExperimentDetection TimeRLM - Issues with JoinsRLM – Shared LearningRLM - EvaluationSlide 23RLM – Performance MetricsRLM – Performance ResultsSlide 26Slide 27Slide 28Slide 29ConclusionsSlide 31ReferencesReceiver-driven Layered MulticastPaper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996Presented By – Manoj SivakumarOverviewIntroductionApproaches to Rate-Adaptive MultimediaIssues and challengesRLM - DetailsPerformance EvaluationConclusionsIntroductionConsider a typical streaming ApplicationWhat rate should the source send data at ?InternetReceiverSource128 Kb/s X Kb/sApproaches to Rate-Adaptive MultimediaRate Adaptation at Source – based on available network capacityWorks well for a Unicast environmentHow about multicast ?source Receiver 2128 Kb/s X2 Kb/sReceiver 1Receiver 3X1 Kb/sX3 Kb/sExample of HeterogeneityIssues and ChallengesOptimal link utilizationBest possible service to all receiversAbility to cope with Congestion in the networkAll this should be done with just best effort service on the internetLayered ApproachRather than sending a single encoded video signal the source sends several layers of encoded signal – each layer incrementally refining the quality of the signalIntermediate Routers drop higher layers when congestion occursLayered ApproachEach layer is sent to one multicast groupIf a receiver wants higher quality – subscribes to all higher level layer multicast groupsIssue in Layered ApproachNo framework for explicit signaling between the receivers and routersA mechanism to adapt to both static heterogeneity and dynamic variations in network capacity is not presentSolution - RLMRLM – Network ModelWorks with IP MulticastAssumeBest effort (packets may be out of order, lost or arbitrarily delayed)Multicast (traffic flows only along links with downstream recipients)Group oriented communication (senders do not know of receivers and receivers can come and go)Receivers may specify different sendersRLM - Video StreamsOne channel per layerLayers are additiveAdding more channels gives better qualityAdding more channels requires more bandwidthRLM SessionsEach session composed of layers, with one layer per groupLayers can be separate (i.e. each layer is higher quality) or additive (add all to get maximum quality)Additive is more efficientRouter MechanismsDropping of packetsDrop less preferential packets firstRLM - ProtocolAbstractionon congestion, drop a layeron spare capacity, add a layerRLM – Adding and Dropping layersDrop layer when packet lossAdd does not have counter-part signalNeed to try adding at well-chosen timesCalled join experimentRLM – Adding and Dropping layersIf join experiment failsDrop layer, since causing congestionIf join experiment succeedsOne step closer to operating levelBut join experiments can cause congestionOnly want to try when might succeedRLM – Join ExperimentsGet lowest layer and start timer for next probeInitially timer smallIf higher level fails then increase timer duration else proceed to next layer and start time for the layer above itRepeat until optimumRLM Join ExperimentHow to know is join experiment succeededDetection timeDetection TimeHard to estimateCan only be done experimentallyInitially start with a large valueProgressively update the detection time based on actual valuesRLM - Issues with JoinsIs this ScalableWhat if each node does join experiments and the same time for different layersWrong info to node that requests lower layer if the other node had requested higher layerSolution – Shared LearningRLM – Shared LearningEach node broadcasts its intent to the groupAdv’s – other nodes can learn from the result of this node’s experimentReduction in simultaneous experimentsIs this still foolproof ??RLM - EvaluationSimulations performed in NSVideo modeled as CBRParametersBandwidth: 1.5 MbpsLayers: 6, each 32 x 2m kbps (m = 0 … 5)Queue management :Drop TailQueue Size (20 packets)Packet size (1 Kbytes)Latency (varies)Topology (next slide)RLM - EvaluationTopologies1 – explore latency2 – explore scalability3 – heterogeneous with two sets4 – large number of independent sessionsRLM – Performance MetricsWorse-case lost rate over varying time intervalsShort-term: how bad transient congestion isLong-term: how often congestion occursThroughput as percent of availableBut will always be 100% eventuallySo, look at time to reach optimalNote, neither alone is okCould have low loss, low throughputHigh loss, high throughputNeed to look at bothRLM – Performance ResultsLatency ResultsRLM – Performance ResultsLatency ResultsRLM – Performance ResultsSession SizeRLM – Performance ResultsConvergence rateRLM – Performance ResultsBandwidth HeterogeneityConclusionsPossible PitfallsShared Learning assumes only multicast trafficIs this valid ??Is congestion produced by Multicast traffic aloneSimulation does not other traffic requests!!ConclusionsOverall – a nice architecture and mechanism to regulate traffic and have the best utilizationBut still needs refinementReferencesS. McCanne, V. Jacobson, and M. Vetterli, "Receiver-driven layered multicast," in Proc. SIGCOMM'96, ACM, Stanford, CA, Aug. 1996, pp.


View Full Document

UMBC CMSC 691 - Receiver-driven Layered Multicast

Documents in this Course
NOTES

NOTES

8 pages

OWL

OWL

109 pages

Security

Security

53 pages

SIP

SIP

45 pages

Proposals

Proposals

30 pages

Proposals

Proposals

30 pages

Load more
Download Receiver-driven Layered Multicast
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Receiver-driven Layered Multicast and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Receiver-driven Layered Multicast 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?