DOC PREVIEW
CORNELL CS 5190 - IP Multicast

This preview shows page 1-2-3-4-5-32-33-34-35-65-66-67-68-69 out of 69 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 69 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 69 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 69 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 69 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 69 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 69 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 69 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 69 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 69 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 69 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 69 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 69 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 69 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 69 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 69 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

17: IP MulticastOutlineWhat is multicast?UnicastMulticastIP Multicast IntroductionIP MulticastInternet Group Management Protocol (IGMP)IGMP Example (1)IGMP Example (2)Source Specific Filtering: IGMPv3Multicast Routing DiscussionData FloodingReverse Path Forwarding (RPF)Reverse Path Forwarding ExampleData Distribution ChoicesSource Rooted vs Shared TreesDistance Vector Multicast Routing (DVMRP)DVMRP AlgorithmTruncated Reverse Path Multicast ExampleDVMRP Pruning ExampleDVMRP Grafting ExampleDVMRP ProblemsCore Based Trees (CBT)Group Management in CBTSending Data in CBT (1)Sending Data in CBT (2)Protocol Independent Multicast (PIM)PIM Sparse ModeGroup Management in PIM-SMSending Data in PIM-SMPIM-SM Source Specific BypassRP Joins Source Specific TreeProblems with PIMClassification of Tree Building ChoicesBorder Gateway Multicast Protocol (BGMP)IP Multicast in the Real WorldCommercial MotivationISP ConcernsEconomics of MulticastMulticast ProblemsCurrent ISP Multicast SolutionMulticast TunnelingMulticast Tunneling Example (1)Multicast Tunneling Example (2)MBoneMBone UsageFuture?OuttakesSlide 50Slide 51IGMPv3 Source Filtering (1)IGMPv3 Source Filtering (2)Scoping Multicast TrafficTTL Scoping ExampleAdministrative Scoping ExampleReliable MulticastPIM Rendezvous Point (RP)PowerPoint PresentationSlide 60Administrative Control of TrafficChoosing a Shared Tree RootMulticast Address AllocationMulticast Address Allocation ArchitectureMulticast Address Allocation ExampleAddress Allocation Message ExchangeOperational ProblemsBackchannel TunnelingDebugging Multicast Problems4: Network Layer 4a-117: IP MulticastLast Modified: 01/14/19 12:02 AMBased on slides by Gordon ChaffeeBerkeley Multimedia Research CenterURL: http://bmrc.berkeley.edu/people/chaffee4: Network Layer 4a-2OutlineIP MulticastMulticast routingDesign choicesDistance Vector Multicast Routing Protocol (DVMRP)Core Based Trees (CBT)Protocol Independent Multicast (PIM)Border Gateway Multicast Protocol (BGMP)Issues in IP Multicast Deplyment4: Network Layer 4a-3What is multicast?1 to N communicationNandwidth-conserving technology that reduces traffic by simultaneously delivering a single stream of information to multiple recipients Examples of MulticastNetwork hardware efficiently supports multicast transport•Example: Ethernet allows one packet to be received by many hostsMany different protocols and service models •Examples: IETF IP Multicast, ATM Multipoint4: Network Layer 4a-4UnicastRSenderProblemSending same data to many receivers via unicast is inefficientExamplePopular WWW sites become serious bottlenecks4: Network Layer 4a-5MulticastRSenderEfficient one to many data distribution4: Network Layer 4a-6IP Multicast IntroductionEfficient one to many data distributionTree style data distributionPackets traverse network links only onceLocation independent addressingIP address per multicast groupReceiver oriented service modelApplications can join and leave multicast groupsSenders do not know who is listeningSimilar to television modelContrasts with telephone network, ATM4: Network Layer 4a-7IP MulticastServiceAll senders send at the same time to the same groupReceivers subscribe to any groupRouters find receiversUnreliable deliveryReserved IP addresses224.0.0.0 to 239.255.255.255 reserved for multicastStatic addresses for popular services (e.g. Session Announcement Protocol)4: Network Layer 4a-8Internet Group Management Protocol (IGMP)Protocol for managing group membershipIP hosts report multicast group memberships to neighboring routersMessages in IGMPv2 (RFC 2236)•Membership Query (from routers)•Membership Report (from hosts)•Leave Group (from hosts)Announce-Listen protocol with SuppressionHosts respond only if no other hosts has respondedSoft State protocol4: Network Layer 4a-9IGMP Example (1)Network 1Host 1 begins sending packetsNo IGMP messages sentPackets remain on Network 1Router periodically sends IGMP Membership QueryNetwork 2Router12434: Network Layer 4a-10IGMP Example (2)Network 1Host 3 joins conferenceSends IGMP Membership Report messageRouter begins forwarding packets onto Network 2Host 3 leaves conferenceSends IGMP Leave Group messageOnly sent if it was the last host to send an IGMP Membership Report messageNetwork 2Router12433Membership Report33Leave Group4: Network Layer 4a-11Source Specific Filtering: IGMPv3Adds Source Filtering to group selectionReceive packets only from specific source addressesReceive packets from all but specific source addressesBenefitsHelps prevent denial of service attacksBetter use of bandwidthStatus: Internet Draft?4: Network Layer 4a-12Multicast Routing DiscussionWhat is the problem?Need to find all receivers in a multicast groupNeed to create spanning tree of receiversDesign goalsMinimize unwanted trafficMinimize router stateScalabilityReliability4: Network Layer 4a-13Data FloodingSend data to all nodes in networkProblemNeed to prevent cyclesNeed to send only once to all nodes in networkCould keep track of every packet and check if it had previously visited node, but means too much stateSenderR3R1R24: Network Layer 4a-14Reverse Path Forwarding (RPF)Simple technique for building treesSend out all interfaces except the one with the shortest path to the senderIn unicast routing, routers send to the destination via the shortest pathIn multicast routing, routers send away from the shortest path to the sender4: Network Layer 4a-15Reverse Path Forwarding ExampleR5 R6R3R2R1R4 R7Sender2. Router R2 accepts packets sent from Router R1 because that is the shortest path to the Sender. The packet gets sent out all interfaces.1. Router R1 checks: Did the data packet arrive on the interface with the shortest path to the Sender? Yes, so it accepts the packet, duplicates it, and forwards the packet out all other interfaces except the interface that is the shortest path to the sender (i.e the interface the packet arrived on). DropDrop3. Router R2 drops packets that arrive from Router R3 because that is not the shortest path to the sender. Avoids cycles.4: Network Layer 4a-16Data Distribution ChoicesSource rooted treesState in routers for each senderForms shortest path tree from each sender to receiversMinimal delays from sources to destinationsShared treesAll


View Full Document

CORNELL CS 5190 - IP Multicast

Download IP 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 IP 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 IP 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?