Chapter 4 IP Multicast Professor Rick Han University of Colorado at Boulder

Slides:



Advertisements
Similar presentations
Computer Networking A Top-Down Approach Chapter 4.7.
Advertisements

Introduction 1 Lecture 22 Network Layer (Broadcast and Multicast) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Multicasting 1. Multicast Applications News/sports/stock/weather updates Distance learning Configuration, routing updates, service location Pointcast-type.
Multicast on the Internet CSE April 2015.
Multicasting CSE April Internet Multicast Service Model Multicast group concept: use of indirection a host “sends” IP datagrams to multicast.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
1 Internet Networking Spring 2004 Tutorial 7 Multicast Routing Protocols.
School of Information Technologies Internet Multicasting NETS3303/3603 Week 10.
Chapter 5 Transport Layer: UDP, TCP Professor Rick Han University of Colorado at Boulder
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Chapter 4 Hierarchy, DHCP, ICMP Professor Rick Han University of Colorado at Boulder
Internet Networking Spring 2002
1 IP Multicasting. 2 IP Multicasting: Motivation Problem: Want to deliver a packet from a source to multiple receivers Applications: –Streaming of Continuous.
EE689 Lecture 12 Review of last lecture Multicast basics.
1 CSE 401N:Computer Network LECTURE-14 MULTICAST ROUTING.
MULTICASTING Network Security.
© J. Liebeherr, All rights reserved 1 IP Multicasting.
CSE679: Multicast and Multimedia r Basics r Addressing r Routing r Hierarchical multicast r QoS multicast.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Computer Networks 2 Lecture 1 Multicast.
Multicasting  A message can be unicast, multicast, or broadcast.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
Network Layer4-1 R1 R2 R3R4 source duplication R1 R2 R3R4 in-network duplication duplicate creation/transmission duplicate Broadcast Routing r Deliver.
Network Layer introduction 4.2 virtual circuit and datagram networks 4.3 what’s inside a router 4.4 IP: Internet Protocol  datagram format  IPv4.
Network Layer introduction 4.2 virtual circuit and datagram networks 4.3 what’s inside a router 4.4 IP: Internet Protocol  datagram format  IPv4.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
1 Chapter 16b Multicasting. Chapter 16b Multicasting 2 Multicasting Applications Multimedia Multimedia –television, presentations, etc. Teleconferencing.
CS 5565 Network Architecture and Protocols Godmar Back Lecture 22.
Broadcast and Multicast. Overview Last time: routing protocols for the Internet  Hierarchical routing  RIP, OSPF, BGP This time: broadcast and multicast.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
Chapter 15 Multicasting and Multicast Routing
Computer Science 6390 – Advanced Computer Networks Dr. Jorge A. Cobb Deering, Estrin, Farinacci, Jacobson, Liu, Wei SIGCOMM 94 An Architecture for Wide-Area.
Multicast Routing Protocols. The Need for Multicast Routing n Routing based on member information –Whenever a multicast router receives a multicast packet.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
Multicast Routing, Error Control, and Congestion Control.
IP Multicast COSC Addressing Class D address Ethernet broadcast address (all 1’s) IP multicast using –Link-layer (Ethernet) broadcast –Link-layer.
CS 4396 Computer Networks Lab IP Multicast - Fundamentals.
Introduction to Multicast Routing Protocols
© J. Liebeherr, All rights reserved 1 IP Multicasting.
Chapter 16 Exterior Routing Protocols and Multicasting 1 Chapter 16 Exterior Routing Protocols And Multicasting.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
1 IP Multicasting Relates to Lab 10. It covers IP multicasting, including multicast addressing, IGMP, and multicast routing.
©The McGraw-Hill Companies, Inc., 2000© Adapted for use at JMU by Mohamed Aboutabl, 2003Mohamed Aboutabl1 1 Chapter 14 Multicasting And Multicast Routing.
4: Network Layer4-1 Chapter 4: Network Layer Last time: r Internet routing protocols m RIP m OSPF m IGRP m BGP r Router architectures r IPv6 Today: r IPv6.
Multicasting  A message can be unicast, multicast, or broadcast. Let us clarify these terms as they relate to the Internet.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Multicast Communications
Spring 2006CS 3321 Multicast Outline Link-state Multicast Distance-vector Multicast Protocol Independent Multicast.
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
2/25/20161 Multicast on the Internet CSE 6590 Fall 2009.
Multicasting EECS June Multicast One-to-many, many-to-many communications Applications: – Teleconferencing – Database – Distributed computing.
Communication Networks Recitation 11. Multicast & QoS Routing.
DMET 602: Networks and Media Lab Amr El Mougy Yasmeen EssamAlaa Tarek.
1 Group Communications: Reverse Path Multicast Dr. Rocky K. C. Chang 19 March, 2002.
DMET 602: Networks and Media Lab
Multicast Outline Multicast Introduction and Motivation DVRMP.
(How the routers’ tables are filled in)
CMPE 252A: Computer Networks
ECE544: Communication Networks-II Spring 2013
Multicast on the Internet
IP Multicast COSC /5/2019.
EE 122: Lecture 13 (IP Multicast Routing)
Implementing Multicast
Optional Read Slides: Network Multicast
Presentation transcript:

Chapter 4 IP Multicast Professor Rick Han University of Colorado at Boulder

Prof. Rick Han, University of Colorado at Boulder Announcements Netstat portion of Homework #3 on Web, due March 12 (two weeks) Programming Assignment #2 coming Friday… Midterm March 14 Next, IP multicast

Prof. Rick Han, University of Colorado at Boulder Network Topology for Programming Assignment #2 B F A C E D Figure 1 1. Distance Vector Routing 2. Link State Routing

Prof. Rick Han, University of Colorado at Boulder Recap of Previous Lecture More on Hierarchy in the Internet BGP, IBGP OSPF Subnets and CIDR prefixes DHCP Dynamic IP address Local client broadcasts to DHCP Relay, which unicasts to a DHCP Server ICMP Reports IP packet delivery errors back to source Ping: ICMP echo and echo reply, “smurf” attack Traceroute: ICMP time expired Router advertisement and solicitation

Prof. Rick Han, University of Colorado at Boulder IP Multicast Unicast: one source to one destination Broadcast: one source to every destination Multicast: one source to N destinations –Variant: N sources to N destinations Application Scenarios: –Video conference –Audio concert –Interactive games Example: –C wants to multicast to D and F Multicast Receiver Multicast Receiver Multicast Sender

Prof. Rick Han, University of Colorado at Boulder IP Multicast (2) How do we multicast 1->N efficiently? –N unicast connections can waste bandwidth over shared links not scalable: sender would have to send 100,000 copies of the same packet to 100,000 subscribers –Hint: use the shortest path spanning tree to efficiently route multicast packets

Prof. Rick Han, University of Colorado at Boulder Link-State IP Multicast Dijkstra gives us the shortest path spanning tree –Root B of multicast tree sends packets only to nearest neighbors on tree, rather than to 100,000 members –Neighbors forward to their neighbors along shortest path tree, and so on… –Also called MOSPF

Prof. Rick Han, University of Colorado at Boulder Link-State IP Multicast (2) How does a router know an IP packet is a multicast packet, and not a unicast packet? –IP packets have a special multicast address –Class D IP addresses: top 4 bits are “1110” followed by 28 bits to identify the multicast “group” address G Not all nodes want to be part of the multicast tree –Participating nodes announce that they want to be part of the tree –A Designated Router on each LAN hears this and floods Link State Packets that this LAN has a multicast group member All routers learn multicast membership of entire network

Prof. Rick Han, University of Colorado at Boulder Link-State IP Multicast (3) Forwarding of packets: –When a router R receives a packet from S with destination multicast address G, it Performs Dijkstra calculation with S as root (not R) if not already in cache Finds itself (R ) in tree For each subtree from R with a group member, –Cache info for this subtree –Forward packet to subtree –Example: S=B, R=E Member Sender

Prof. Rick Han, University of Colorado at Boulder Distance Vector Multicast (DVMRP) How do we use distance vectors to achieve multicast? –Dijkstra’s shortest path tree was more intuitive –Distance vectors tell us next-hop path for shortest route to destination –Basic method: Flood, then Prune Flood: Reverse-Path Broadcast –When receiving a multicast packet to group G from source S Does packet arrive from the shortest-hop link to S? If yes, then multicast on all other outgoing links –This efficiently floods the network Any source can send to any node along a shortest hop tree

Prof. Rick Han, University of Colorado at Boulder DVMRP (2) Flooding Example : Reverse-Path Broadcast –When E receives a multicast packet to group G from source S=C, Does packet arrive from the shortest-hop link to B? Yes, it arrived on B-E link which is next hop using the spanning tree centered on E Since yes, then multicast on all other outgoing links –To A, F, and D –This floods the network Compare to LSP’s reliable flooding

Prof. Rick Han, University of Colorado at Boulder DVMRP (3) Problems with Reverse-Path Broadcast –Since we’re flooding on all outgoing links, then multiple routers on same Ethernet send copies of same packet Solution: assign a parent router on each link. For each source S, the parent router is the one closest to S. B-C link is Ethernet LAN Parent

Prof. Rick Han, University of Colorado at Boulder DVMRP (4) Problems with Reverse-Path Broadcast –Flooding the network reaches nodes who don’t want to be part of the multicast group –Solution: Prune using Reverse-Path Multicast Same “parent” router knows it’s a leaf when it is the only router in a network Each host that is a member of G periodically broadcasts its membership Parent router hears this, and will forward multicast packets to this LAN If parent hears no members, then sends “no members” up the shortest path tree

Prof. Rick Han, University of Colorado at Boulder DVMRP (5) Pruning Example: –B sends to multicast group G consisting of F and D This message floods E sends a request to its leaf nodes: is anyone part of group G? –F and D respond, A does not E prunes A (remembers not to forward to A when it receives a multicast dest addr G) C is also pruned from B Sender Member

Prof. Rick Han, University of Colorado at Boulder Protocol Independent Multicast (PIM) Problems with MOSPF and DVMRP –Each router has to have state –Flooding is costly in DVMRP Routers not part of multicast group are flooded, then prune via “No members” messages –When only a few “sparse” nodes in multicast tree, then flooding and state storage become excessive

Prof. Rick Han, University of Colorado at Boulder PIM (2) PIM “sparse” mode –Create a Rendezvous Point (RP) for each multicast group –From a multicast tree rooted from the well-known RP Reverse path tree formed from unicast Joins by leaf nodes –Senders unicast to RP, which then multicasts along tree Rendezvous Point

Prof. Rick Han, University of Colorado at Boulder PIM (3) PIM “sparse” mode –If a particular sender transmits frequently then Receiver sees many packets with Then, receiver sends a Join to the source Reverse path multicast tree is formed to the source, rather than to RP

Prof. Rick Han, University of Colorado at Boulder Internet Group Management Protocol (IGMP) Used to join and leave multicast groups A multicast-enabled router on a LAN sends membership_query IGMP message –“Is anyone part of multicast group G?” A multicast-enabled host replies with an IGMP membership_report –“Yes, I’m part of multicast group G” –Host can send unsolicited membership_report to explicitly join a multicast group –Router only needs to know that one host on LAN is a member of group G, not which host nor how many hosts Feedback suppression

Prof. Rick Han, University of Colorado at Boulder Other Multicasting Issues Source doesn’t have to be a member of a multicast tree! –Any malicious user can overwhelm a multicast tree Source doesn’t have to know in advance who is in multicast tree –Clean decoupling of senders and receivers Receiver-driven multicast model [Deering, 1990] –Any host can send an IGMP Join message to its attached IP multicast-enabled router No control over who joins an IP multicast group –How do you prevent someone from subscribing at the IP router level? –Once in a multicast group, can eavesdrop

Prof. Rick Han, University of Colorado at Boulder Other Multicasting Issues (2) Multicast is unreliable –Uses UDP datagrams over IP multicast datagrams How do we design a reliable multicast protocol? –Suppose B reliably multicasts, and F and D are both members of multicast tree –F and D both send ACK’s upstream –Source can get swamped with ACK’s –Solution: put ACK filters in intermediate routers Would have to understand TCP semantics Controversial