1 / 15

Chapter 15

Chapter 15. Multicasting and Multicast Routing Protocols. Objectives. Differentiate between a unicast and a multicast message Understand multicast link state routing and MOSPF Understand the Protocol Independent Multicast Protocols. UNICAST and MULTICAST.

gaston
Download Presentation

Chapter 15

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 15 Multicasting andMulticast Routing Protocols Objectives • Differentiate between a unicast and a multicast message • Understand multicast link state routing and MOSPF • Understand the Protocol Independent Multicast Protocols TCP/IP Protocol Suite

  2. UNICAST and MULTICAST A message can be unicast, multicast, or broadcast. Let us clarify these terms as they relate to the Internet. In unicast communication, there is one source and one destination. The relationship between the source and destination is one-to-one. In unicasting, the router forwards the received packet through only one of its interfaces. TCP/IP Protocol Suite

  3. Multicasting In multicast communication, there is one source and a group of destinations. The relationship is one-to-many. In multicasting, the router may forward the received packetthrough several of its interfaces. Multicasting has many applications today such as access to distributed databases, information dissemination, teleconferencing, and distance learning. TCP/IP Protocol Suite

  4. Multicasting versus multiple unicasting Emulation of multicasting through multiple unicasting is not efficient and may create long delays, particularly with a large group. TCP/IP Protocol Suite

  5. Shortest path tree in unicast routing In unicast routing, each router in the domain has a table that defines a shortest path tree to possible destinations. TCP/IP Protocol Suite

  6. Source-based tree approach There are two types of shortest path tree in multicast routing: source-based tree and group-shared tree. In the source-based tree approach, each router needs to have one shortest path tree for each group. TCP/IP Protocol Suite

  7. Group-shared tree approach In the group-shared tree approach, only the core router, which has a shortest path tree for each group, is involved in multicasting. TCP/IP Protocol Suite

  8. Taxonomy of common multicast protocols MOSPF: Multicast Open Shortest Path First DVMRP: Distance Vector Multicast Routing Protocol PIM: Protocol Independent Multicast PIM-DM: PIM, Dense Mode PIM-SM: PIM, Sparse Mode CBT: Core-Based Tree No multicast router available in today’s Internet TCP/IP Protocol Suite

  9. Multicasting Routing Protocols MOSPF is a multicast link state routing using source-based tree approach. DVMRP is a multicast distance vector routing. The Core-Based Tree (CBT) protocol is a group-shared protocol that uses a core as the root of the tree. The autonomous system is divided into regions and a core (center router or rendezvous router) is chosen for each region. PIM-DM is used in a dense multicast environment, such as a LAN. PIM-SM is used in a sparse multicast environment such as a WAN. TCP/IP Protocol Suite

  10. Summary • Intradomain and interdomain routing • Unicast routing: distance vector routing, link state, path vector routing • RIP, OSPF and BGP • RIP table update • Dijkstra’s shortest path algorithm to find the shortest path tree • Difference between multicast and unicast • Source-based multicast tree and group based multicast tree TCP/IP Protocol Suite

  11. Excises 1. A router running RIP has a routing table with 20 entries. How many periodic timers are needed to handle this table? How many expiration timers are needed to handle this table? Suppose 5 routes are invalid, how many garbage collection timer are needed to handle this table? 2. Below is a network, using Dijkstra algorithm to find the shortest path tree of the node A and E, and construct their routing table. 2 F E A 6 3 5 C 2 6 2 H 4 8 4 3 5 G D B TCP/IP Protocol Suite

  12. Solutions • 1 periodic timer is needed. • 20 expiration timer are needed • 5 garbage timer are needed, each for 1 invalid entry • 2. Shortest path tree for A 11 F E A 9 C H 5 14 12 G D 7 B 4 TCP/IP Protocol Suite

  13. Solutions-cont. I 2. Routing table of A TCP/IP Protocol Suite

  14. Solutions-cont. II 2. Shortest path tree of E F 2 E A 9 6 C H 5 4 G D 2 B 5 TCP/IP Protocol Suite

  15. Solutions-cont. III 2. Routing table of A TCP/IP Protocol Suite

More Related