Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 15 Multicasting and Multicast Routing

Similar presentations


Presentation on theme: "Chapter 15 Multicasting and Multicast Routing"— Presentation transcript:

1 Chapter 15 Multicasting and Multicast Routing

2 15.1 Unicast, Multicast and Broadcast
A message can be unicast, multicast, or broadcast. Let us clarify these terms as they relate to the Internet. Unicasting In unicasting, the router forwards the received packet through only one of its interfaces

3 Unicast, Multicast and Broadcast (cont’d)
Multicasting In multicasting, the router may forward the received packet through several of its interfaces

4 Unicast, Multicast and Broadcast (cont’d)
Broadcasting one-to-call The Internet does not explicitly support broadcasting because of huge amount of traffic it would create and because of the bandwidth it would need.

5 Unicast, Multicast and Broadcast (cont’d)
Multicasting versus Multiple Unicasting Sending to a group of people

6 15.2 Multicast Applications
Access to Distributed Databases Information Dissemination Dissemination of News Teleconferencing Distance Learning

7 15.3 Multicasting Routing Optimal routing: Shortest pass trees
Unicast Routing In unicast routing, each router in the domain has a table that defines a shortest path tree to possible destinations.

8 Multicasting Routing (cont’d)
Multicast Routing In multicast routing, each involved router needs to construct a shortest path tree for each group. Source-based Tree In the source-based tree approach, each router needs to have one shortest path tree for each group Group-shared Tree In the group-shared tree approach, only the core router, which has a shortest path tree for each group, is involved in multicasting.

9 Multicasting Routing (cont’d)

10 Multicasting Routing (cont’d)
Routing Protocols

11 15.4 Multicast Link State Routing: MOSPF
Multicast link state routing uses the source-based tree approach MOSPF is an extension of the OSPF protocol that uses multicast link state routing to create source-based trees Data-driven protocol the first time an MOSPF router sees a datagram with source and group address, the router constructs the Dijkstra shortest path tree.

12 15.5 Multicast Distance Vector: DVMRP
Multicast Distance Vector Routing Multicast routing does not allow a router to send its routing table to its neighbors. Creating a table from scratch using the information from the unicast distance vector tables Using source-based trees But router never actually make a routing table 4-decision making strategies Flooding Flooding broadcasts packets, but creates loops in the systems

13 Multicast Distance Vector: DVMRP (cont’d)
Reverse Path Forwarding (RPF) If the packet has traveled from the shortest path; it discards it otherwise to prevent loops, only one copy is forwarded; other copies are dropped

14 Multicast Distance Vector: DVMRP (cont’d)
Reverse Path Broadcasting (RPB)

15 Multicast Distance Vector: DVMRP (cont’d)
RPB creates a shortest path broadcast tree from the source to each destination. It guarantees that each destination receives one and only one copy of the packet.

16 Multicast Distance Vector: DVMRP (cont’d)
RPM adds pruning and grafting to RPB to create a multicast shortest path tree that supports dynamic membership changes.

17 Multicast Distance Vector: DVMRP (cont’d)
RPM adds pruning and grafting to RPB to create a multicast shortest path tree that supports dynamic membership changes. Distance vector multicasting routing protocol (DVMRP) an implementation of multicast distance vector routing source-based routing protocol, based on RIP

18 15.6 Core-based Tree (CBT) 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. In CBT, the source sends the multicast packet (encapsulated in a unicast packet) to the core router. The core router decapsulates the packet and forwards it to all interested interfaces.

19 Core-based Tree (CBT)

20 15.7 PIM Protocol Independent Multicast (PIM) is the name given to two independent multicast routing protocols: Protocol Independent Multicast, Dense Mode (PIM-DM) and Protocol Independent Multicast, Sparse Mode (PIM-SM). PIM-DM PIM-DM is used in a dense multicast environment, such as a LAN. PIM-SM PIM-SM is used in a sparse multicast environment such as a WAN. PIM-SM is similar to CBT but uses a simpler procedure.

21 15.8 MBONE A multicast router may not find another multicast router in the neighborhood to forward the multicast packet. A solution for this problem is tunneling. We make a multicast backbone (MBONE) out of these isolated routers using the concept of tunneling.

22 MBONE (cont’d)


Download ppt "Chapter 15 Multicasting and Multicast Routing"

Similar presentations


Ads by Google