Computer Networks

B.Tech (V) Sem CSE

By

Manoj Kumar Singh

Assistant Professor
Department of Computer Science & Engineering

1 Lecture by: Manoj Kumar Singh

 Unit-3
Network Layer
(Topics- Multicast Routing Protocol

2 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 A message can be unicast, multicast, or broadcast.

 Unicasting
 In unicast communication, there is one source and one destination. The
relationship between the source and the destination is one-to-one.

 In this type of communication, both the source and destination addresses, in

the IP datagram, are the unicast addresses assigned to the hosts (or host
interfaces, to be more exact).

 In unicasting, the router forwards the received packet through only one of its
interfaces.

3 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Unicasting

4 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Multicasting
 In multicast communication, there is one source and a group of destinations.
The relationship is one-to-many.

 In this type of communication, the source address is a unicast address, but the
destination address is a group address, which defines one or more destinations.

 A multicast packet starts from the source S1 and goes to all destinations that
belong to group G1. In multicasting, when a router receives a packet, it may
forward it through several of its interfaces.

5 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Multicasting

6 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Broadcasting
 In broadcast communication, the relationship between the source and the
destination is one-to-all.

 There is only one source, but all the other hosts are the destinations.

 The Internet does not explicitly support broadcasting because of the huge
amount of traffic it would create and because of the bandwidth it would need.

7 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Multicast Routing
 When a router receives a multicast packet, the situation is different from when
it receives a unicast packet. A multicast packet may have destinations in more
than one network.

 Forwarding of a single packet to members of a group requires a shortest path

tree.

 If we have n groups, we may need n shortest path trees. We can imagine the
complexity of multicast routing.

 Two approaches have been used to solve the problem:

 source-based trees and group-shared trees.

8 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Source-Based Tree
 In the source-based tree approach, each router needs to have one shortest path
tree for each group.

 The shortest path tree for a group defines the next hop for each network that
has loyal member(s) for that group.

9 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Source-Based Tree

10 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Group-Shared Tree
 In the group-shared tree approach, instead of each router having m shortest
path trees, only one designated router, called the center core, or rendezvous
router, takes the responsibility of distributing multicast traffic.

 The core has m shortest path trees in its routing table. The rest of the routers in
the domain have none.

 If a router receives a multicast packet, it encapsulates the packet in a unicast

packet and sends it to the core router.

 The core router removes the multicast packet from its capsule, and consults its
routing table to route the packet.

11 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Group-Shared Tree

12 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Routing Protocols

13 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Multicasting Protocols
 MOSPF
 Multicast Open Shortest Path First (MOSPF) protocol is an extension of the OSPF protocol that
uses multicast link state routing to create source-based trees.

 The protocol requires a new link state update packet to associate the unicast address of a host
with the group address or addresses the host is sponsoring.
 This packet is called the group-membership LSA.

 In this way, we can include in the tree only the hosts (using their unicast addresses) that belong
to a particular group.

 In other words, we make a tree that contains all the hosts belonging to a group, but we use the
unicast address of the host in the calculation. For efficiency, the router calculates the shortest
path trees on demand (when it receives the first multicast packet).

 In addition, the tree can be saved in cache memory for future use by the same source/group
pair.

 MOSPF is a data-driven protocol; the first time an MOSPF router sees a datagram with a given
source and group address, the router constructs the Dijkstra shortest path tree.

14 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 Multicasting Protocols
 MDVR (Multicast Distance Vector Routing )
 Unicast distance vector routing is very simple; extending it to support multicast
routing is complicated.

 Multicast routing does not allow a router to send its routing table to its
neighbors. The idea is to create a table from scratch by using the information
from the unicast distance vector tables.

 Multicast distance vector routing uses source-based trees, but the router never
actually makes a routing table. When a router receives a multicast packet, it
forwards the packet as though it is consulting a routing table.

 DVMRP
 The Distance Vector Multicast Routing Protocol (DVMRP) is an
implementation of multicast distance vector routing. It is a source-based
routing protocol, based on RIP.

15 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 CRT
 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.

 Formation of the Tree

 After the rendezvous point is selected, every router is infonned of the unicast
address of the selected router. Each router then sends a unicast join message
(similar to a grafting message) to show that it wants to join the group.

 This message passes through all routers that are located between the sender
and the rendezvous router. Each intermediate router extracts the necessary
infonnation from the message, such as the unicast address of the sender and the
interface through which the packet has arrived, and forwards the message to
the next router in the path.

16 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 CRT (Cont..)
 When the rendezvous router has received all join messages from every member
of the group, the tree is formed. Now every router knows its upstream router
(the router that leads to the root) and the downstream router (the router that
leads to the leaf).

 If a router wants to leave the group, it sends a leave message to its upstream
router. The upstream router removes the link to that router from the tree and
forwards the message to its upstream router, and so on.

 In CRT, 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.

17 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 CRT (Cont..)

18 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 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 when there is a possibility that each router is involved in
multicasting (dense mode). In this environment, the use of a protocol that
broadcasts the packet is justified because almost all routers are involved in the
process.

 PIM-SM
 PIM-SM is used when there is a slight possibility that each router is involved in
multicasting (sparse mode). In this environment, the use of a protocol that
broadcasts the packet is not justified; a protocol such as CBT that uses a group-
shared tree is more appropriate.
19 Lecture by: Manoj Kumar Singh
 Multicast Routing Protocol
 MBONE
 Multimedia and real-time communication have increased the need for
multicasting in the Internet. However, only a small fraction of Internet routers
are multicast routers.

 The multicast routers are seen as a group of routers on top of unicast routers.
The multicast routers may not be connected directly, but they are connected
logically. Figure shows the idea.

 In Figure, only the routers enclosed in the shaded circles are capable of
multicasting. Without tunneling, these routers are isolated islands.

 To enable multicasting, we make a multicast backbone (MBONE) out of these

isolated routers by using the concept of tunneling.

20 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 MBONE

21 Lecture by: Manoj Kumar Singh

 Multicast Routing Protocol
 MBONE
 A logical tunnel is established by encapsulating the multicast packet inside a
unicast packet. The multicast packet becomes the payload (data) of the unicast
packet.
 Figure shows the concept. So far the only protocol that supports MBONE and
tunneling is DVMRP.

22 Lecture by: Manoj Kumar Singh

 Summary
 Multicast Routing Protocol

23 Lecture by: Manoj Kumar Singh