CS4700/CS5700 Fundamentals of Computer Networks

Transcription

1 CS4700/CS5700 Fundamentals of Computer Networks Lecture 19: Multicast Routing Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu Northeastern 1 University

2 Terminologies What is unicast? Cast: to send, to throw Broadcast: to send everywhere (recall broadcast in local area Ethernet, ARP, DHCP) Unicast: to send to a single receiver Point-to-point communication Nearly all wide-area Internet traffic is unicast Web traffic, SSH traffic, FTP traffic Two unicast streams, one in each direction What is multicast? In between unicast and broadcast Each packet is sent to multiple specific receivers Point-to-Multipoint communication What is multicast useful for??? Alan Mislove amislove at ccs.neu.edu Northeastern 2 University

3 Internet TV radio Stock price update Video conference Spam?! Example Uses Alan Mislove amislove at ccs.neu.edu Northeastern 3 University

4 How to Send to Multiple Receivers? Alan Mislove amislove at ccs.neu.edu Northeastern 4 University

5 How to Send to Multiple Receivers? What are the simplest ways? Alan Mislove amislove at ccs.neu.edu Northeastern 4 University

6 How to Send to Multiple Receivers? What are the simplest ways? Ex1: Send a copy of the packet to one receiver at a time until all receivers have it i.e. use unicast to implement multicast Alan Mislove amislove at ccs.neu.edu Northeastern 4 University

7 How to Send to Multiple Receivers? What are the simplest ways? Ex1: Send a copy of the packet to one receiver at a time until all receivers have it i.e. use unicast to implement multicast Ex2: Flood a packet throughout the network and have non-receivers discard the packet i.e. use broadcast to implement multicast Alan Mislove amislove at ccs.neu.edu Northeastern 4 University

8 How to Send to Multiple Receivers? What are the simplest ways? Ex1: Send a copy of the packet to one receiver at a time until all receivers have it i.e. use unicast to implement multicast Ex2: Flood a packet throughout the network and have non-receivers discard the packet i.e. use broadcast to implement multicast Advantages? Disadvantages? Alan Mislove amislove at ccs.neu.edu Northeastern 4 University

9 How to Send to Multiple Receivers? What are the simplest ways? Ex1: Send a copy of the packet to one receiver at a time until all receivers have it i.e. use unicast to implement multicast Ex2: Flood a packet throughout the network and have non-receivers discard the packet i.e. use broadcast to implement multicast Advantages? Disadvantages? In general: We want a distribution tree Many ways to do it Big research topic for a decade Alan Mislove amislove at ccs.neu.edu Northeastern 4 University

10 Example: Internet Radio Sends out 128Kb/s MP3 music streams Peak usage ~9000 simultaneous streams Consumes ~1.1Gb/s bandwidth costs are large fraction of their expenditures A fat and shallow tree Does not scale! Alan Mislove amislove at ccs.neu.edu Northeastern 5 University

11 This approach does not scale Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 6 University

12 This approach does not scale Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 6 University

13 This approach does not scale Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 6 University

14 Use routers in distribution tree Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 7 University

15 Use routers in distribution tree Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 7 University

16 Use routers in distribution tree Copy data at routers At most one copy of a data packet per link Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 7 University

17 Use routers in distribution tree Copy data at routers At most one copy of a data packet per link Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 7 University

18 Use routers in distribution tree Copy data at routers At most one copy of a data packet per link Broadcast Center Backbone ISP Alan Mislove amislove at ccs.neu.edu Northeastern 7 University

19 Use routers in distribution tree Copy data at routers At most one copy of a data packet per link Broadcast Center Backbone ISP LANs implement link layer multicast by broadcasting Alan Mislove amislove at ccs.neu.edu Northeastern 7 University

20 Use routers in distribution tree Copy data at routers At most one copy of a data packet per link Broadcast Center Backbone ISP Routers compute trees and forward packets along them LANs implement link layer multicast by broadcasting Alan Mislove amislove at ccs.neu.edu Northeastern 7 University

21 Multicast Routing Approaches Kinds of Trees Source Specific Trees Most suitable for single sender E.g. internet radio Shared Tree Multiple senders in a group E.g. Teleconference Tree Computation Methods Link state Distance vector Alan Mislove amislove at ccs.neu.edu Northeastern 8 University

22 Source Specific Trees Each source is the root of its own tree One tree per source Tree can consists of shortest paths to each receiver Members of the multicast tree Sender Alan Mislove amislove at ccs.neu.edu Northeastern 9 University

23 Source Specific Trees Each source is the root of its own tree One tree per source Tree can consists of shortest paths to each receiver Very good performance but expensive to construct/maintain; routers need to manage a tree per source Alan Mislove amislove at ccs.neu.edu Northeastern 10 University

24 Shared Tree One tree used by all members in a group Easier to construct/maintain but hard to pick good trees for everyone! Alan Mislove amislove at ccs.neu.edu Northeastern 11 University

25 IPv4 Multicast Multicast Group Address First octet: Class D addresses These are group identifiers Not specific to an end host Flat address space In practice, pick a group address at random, hope no collision No security in the network layer Will use G to designate an IP multicast group address Alan Mislove amislove at ccs.neu.edu Northeastern 12 University

26 IP Multicast Service Model R 0 S Net R 1... R n-1 Receivers join a multicast group which is identified by a multicast address (e.g. G) Sender(s) send data to address G Network routes data to each of the receivers Alan Mislove amislove at ccs.neu.edu Northeastern 13 University

27 IP Multicast Service Model S Net R 1 joins G R 0 joins G R n-1 joins G R 0 R 1... R n-1 Receivers join a multicast group which is identified by a multicast address (e.g. G) Sender(s) send data to address G Network routes data to each of the receivers Alan Mislove amislove at ccs.neu.edu Northeastern 13 University

28 IP Multicast Service Model R 0 S Net R 1... R n-1 Receivers join a multicast group which is identified by a multicast address (e.g. G) Sender(s) send data to address G Network routes data to each of the receivers Alan Mislove amislove at ccs.neu.edu Northeastern 13 University

29 IP Multicast Service Model [G, data] R 0 S [G, data] Net [G, data] R 1 [G, data]... R n-1 Receivers join a multicast group which is identified by a multicast address (e.g. G) Sender(s) send data to address G Network routes data to each of the receivers Alan Mislove amislove at ccs.neu.edu Northeastern 13 University

30 Multicast Implementation Issues How is join implemented? How is send implemented? How much information about trees is kept and who keeps it? Alan Mislove amislove at ccs.neu.edu Northeastern 14 University

31 IP Multicast Routing Intra-domain Distance-vector multicast Link-state multicast Inter-domain Protocol Independent Multicast, Sparse Mode Key idea: Core-Based Tree Alan Mislove amislove at ccs.neu.edu Northeastern 15 University

32 Distance Vector Multicast Routing Protocol (DVMRP) An elegant extension to DV routing Use shortest path DV routes to determine if link is on the source-rooted spanning tree Three steps in developing DVMRP Reverse Path Flooding Reverse Path Broadcasting Truncated Reverse Path Broadcasting Alan Mislove amislove at ccs.neu.edu Northeastern 16 University

33 Reverse Path Flooding (RPF) Extension to DV unicast routing Packet forwarding If incoming link is shortest path to source Send on all links except incoming Packets always take shortest path assuming delay is symmetric Issues Some links (LANs) may receive multiple copies Every link receives each multicast packet, even if no interested hosts s:2 s:1 s:3 s:3 s:2 s r Alan Mislove amislove at ccs.neu.edu Northeastern 17 University

34 Reverse Path Flooding (RPF) Extension to DV unicast routing Packet forwarding If incoming link is shortest path to source Send on all links except incoming Packets always take shortest path assuming delay is symmetric Issues Some links (LANs) may receive multiple copies Every link receives each multicast packet, even if no interested hosts s:2 s:1 s:3 s:3 s:2 s r Alan Mislove amislove at ccs.neu.edu Northeastern 17 University

35 Reverse Path Flooding (RPF) Extension to DV unicast routing Packet forwarding If incoming link is shortest path to source Send on all links except incoming Packets always take shortest path assuming delay is symmetric Issues Some links (LANs) may receive multiple copies Every link receives each multicast packet, even if no interested hosts s:2 s:1 s:3 s:3 s:2 s r Alan Mislove amislove at ccs.neu.edu Northeastern 17 University

36 Reverse Path Flooding (RPF) Extension to DV unicast routing Packet forwarding If incoming link is shortest path to source Send on all links except incoming Packets always take shortest path assuming delay is symmetric Issues Some links (LANs) may receive multiple copies Every link receives each multicast packet, even if no interested hosts s:2 s:1 s:3 s:3 s:2 s r Alan Mislove amislove at ccs.neu.edu Northeastern 17 University

37 Reverse Path Flooding (RPF) Extension to DV unicast routing Packet forwarding If incoming link is shortest path to source Send on all links except incoming Packets always take shortest path assuming delay is symmetric Issues Some links (LANs) may receive multiple copies Every link receives each multicast packet, even if no interested hosts s:2 s:1 s:3 s:3 s:2 s r Alan Mislove amislove at ccs.neu.edu Northeastern 17 University

38 Example Flooding can cause a given packet to be sent multiple times over the same link S x y a z duplicate packet b Solution: Called Reverse Path Broadcasting Alan Mislove amislove at ccs.neu.edu Northeastern 18 University

39 Reverse Path Broadcasting (RPB) Chose parent of each link along reverse shortest path to source Only parent forward to a link (child link) Use DV routing update to identify parent child link of x for S a S 5 6 x z y b Alan Mislove amislove at ccs.neu.edu Northeastern 19 University

40 Reverse Path Broadcasting (RPB) Chose parent of each link along reverse shortest path to source Only parent forward to a link (child link) Use DV routing update to identify parent forward only to child link child link of x for S a S 5 6 x z y b Alan Mislove amislove at ccs.neu.edu Northeastern 19 University

41 Don t Really Want to Flood! This is still a broadcast algorithm the traffic goes everywhere Need to Prune the tree when there are subtrees with no group members Solution: Truncated Reverse Path Broadcasting Alan Mislove amislove at ccs.neu.edu Northeastern 20 University

42 Truncated Reverse Path Broadcasting (TRPB) Extend RPB to eliminate unneeded forwarding S Explicit group joining Members periodically send join requests If another LAN member has joined (overheard join message), other members do not send join message Router with no member downstream is removed from tree Router sends prune message to upstream router when no member r2 r1 Alan Mislove amislove at ccs.neu.edu Northeastern 21 University

43 Truncated Reverse Path Broadcasting (TRPB) Extend RPB to eliminate unneeded forwarding S Explicit group joining Members periodically send join requests If another LAN member has joined (overheard join message), other members do not send join message Router with no member downstream is removed from tree Router sends prune message to upstream router when no member r2 r1 Alan Mislove amislove at ccs.neu.edu Northeastern 21 University

44 Truncated Reverse Path Broadcasting (TRPB) Extend RPB to eliminate unneeded forwarding S Explicit group joining Members periodically send join requests If another LAN member has joined (overheard join message), other members do not send join message Router with no member downstream is removed from tree Router sends prune message to upstream router when no member r2 r1 Alan Mislove amislove at ccs.neu.edu Northeastern 21 University

45 Truncated Reverse Path Broadcasting (TRPB) Extend RPB to eliminate unneeded forwarding S Explicit group joining Members periodically send join requests If another LAN member has joined (overheard join message), other members do not send join message Router with no member downstream is removed from tree Router sends prune message to upstream router when no member r2 r1 Alan Mislove amislove at ccs.neu.edu Northeastern 21 University

46 Truncated Reverse Path Broadcasting (TRPB) Extend RPB to eliminate unneeded forwarding S Explicit group joining Members periodically send join requests If another LAN member has joined (overheard join message), other members do not send join message Router with no member downstream is removed from tree Router sends prune message to upstream router when no member r2 r1 Alan Mislove amislove at ccs.neu.edu Northeastern 21 University

47 Truncated Reverse Path Broadcasting (TRPB) Extend RPB to eliminate unneeded forwarding S Explicit group joining Members periodically send join requests If another LAN member has joined (overheard join message), other members do not send join message Router with no member downstream is removed from tree Router sends prune message to upstream router when no member r2 r1 Alan Mislove amislove at ccs.neu.edu Northeastern 21 University

48 Truncated Reverse Path Broadcasting (TRPB) Extend RPB to eliminate unneeded forwarding S Explicit group joining Members periodically send join requests If another LAN member has joined (overheard join message), other members do not send join message Router with no member downstream is removed from tree Router sends prune message to upstream router when no member r2 r1 Alan Mislove amislove at ccs.neu.edu Northeastern 21 University

49 Distance Vector Multicast Scaling State requirements: O(Sources Groups) active state Alan Mislove amislove at ccs.neu.edu Northeastern 22 University

50 Core Based Trees (CBT) The key idea in Inter-domain PIM-SM protocol Pick a rendezvous point for the group called the core Build a tree towards the core Union of the unicast paths from members to the core Shared tree To send, unicast packet to core and bounce it back to multicast group Reduce routing table state from O(S x G) to O(G) Alan Mislove amislove at ccs.neu.edu Northeastern 23 University

51 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

52 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

53 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

54 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

55 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

56 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

57 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

58 Example Group members: M1, M2, M3 M1 sends data core M1 M2 M3 control (join) messages data Alan Mislove amislove at ccs.neu.edu Northeastern 24 University

59 Disadvantages Sub-optimal delay Single point of failure Core goes out and everything lost until error recovery elects a new core Small, local groups with non-local core Need good core selection Optimal choice (computing topological center) is NP hard Alan Mislove amislove at ccs.neu.edu Northeastern 25 University