Scribd
Upload
231 views

Chapter-21 Multicast Routing

Uploaded by

jeyavinotha
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
231 views

Chapter-21 Multicast Routing

Uploaded by

jeyavinotha
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 29

Chapter 21

Multicast
Routing

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
21-1 INTRODUCTION

Communication in the Internet today is


not only unicasting; multicasting
communication is growing fast. In this
section, we first discuss the general
ideas behind unicasting, multicasting,
and broadcasting. We then talk about
some basic issues in multicast routing.
Finally, we discuss multicasting routing
protocols in the Internet.
21.2
221.21.1 Unicasting

In unicasting, there is one source and one


destination network. The relationship between the
source and the destination network is one to one.
Each router in the path of the datagram tries to
forward the packet to one and only one of its
interfaces.

21.3
Figure 221.1: Unicasting

21.4
20.21.2 Multicasting

In multicasting, 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, a group of one or more destination
networks in which there is at least one member of
the group that is interested in receiving the multicast
datagram. The group address defines the members
of the group.

21.5
Figure 221.2: Multicasting

21.6
Figure 221.3: Multicasting versus multiple unicasting

21.7
21-1 MULTICAST BASICS

Before discussing multicast routing


protocols in the Internet, we need to
discuss some multicasting basics:
multicast addressing, collecting
information about multicast groups, and
multicast optimal trees.

21.8
221.2.1 Multicast Addresses

In multicast communication, the sender is only one,


but the receiver is many, sometimes thousands or
millions spread all over the world. It should be clear
that we cannot include the addresses of all recipients
in the packet. The destination address of a packet, as
described in the Internet Protocol (IP) should be
only one. For this reason, we need multicast
addresses. A multicast address defines a group of
recipients, not a single one. In other words, a
multicast address is an identifier for a group.

21.9
Figure 221.4: Needs for multicast addresses

21.10
Figure 221.5: A multicast address in binary

21.11
221.2.3 Collecting Information

Creation of forwarding tables in both unicast and


multicast routing involves two steps:

1. A router needs to know to which destinations it is


connected.
2. Each router needs to propagate information
obtained in the first step to all other routers so that
each router knows to which destination each other
router is connected.

21.12
Figure 221.8: Unicast versus multicast advertisement

21.13
221.2.4 Multicast Forwarding

Another important issue in multicasting is the


decision a router needs to make to forward a
multicast packet. Forwarding in unicast and
multicast communication is different.

21.14
Figure 221.9: Destination in unicasting and multicasting

21.15
Figure 221.10: Forwarding depends on the destination and the source

21.16
221.2.5 Two Approaches to Multicasting

In multicast routing, as in unicast routing, we need


to create routing trees to optimally route the packets
from their source to their destination. However, as
we discussed before, the multicast routing decision
at each router depends not only on the destination of
the packet, but also on the source of the packet. The
involvement of the source in the routing process
makes multicast routing much more difficult than
unicast routing. For this reason, two different
approaches in multicast routing have been
developed: routing using source-based trees and
routing using group-shared trees.
21.17
Shortest path tree in unicast routing

22.18
Source-based tree approach

22.19
Group-shared tree approach

22.20
21-3 INTRADOMAIN PROTOCOLS

During the last few decades, several


intradomain multicast routing protocols
have emerged. In this section, we
discuss three of these protocols. Two
are extensions of unicast routing
protocols (RIP and OSPF), using the
source-based tree approach; the third is
an independent protocol which is
becoming more and more popular.
21.21
221.3.1 DVMRP

The Distance Vector Multicast Routing Protocol


(DVMRP) is the extension of the Routing
Information Protocol (RIP) which is used in unicast
routing. It uses the source-based tree approach to
multicasting. It is worth mentioning that each router
in this protocol that receives a multicast packet to be
forwarded implicitly creates a source-based
multicast tree in three steps:

21.22
Figure 221.11: RPF versus RPB

21.23
Figure 221.12: RPB versus RPM

21.24
221.3.2 Multicast Link State (MOSPF)

Multicast Open Shortest Path First (MOSPF) is the


extension of the Open Shortest Path First (OSPF)
protocol, which is used in unicast routing. It also
uses the source-based tree approach to multicasting.
If the internet is running a unicast link-state routing
algorithm, the idea can be extended to provide a
multicast link-state routing algorithm. To extend
unicasting to multicasting, each router needs to have
another database, as with the case of unicast
distance-vector routing, to show which interface has
an active member in a particular group.

21.25
Figure 221.13: Example of tree formation in MOSPF

21.26
221.3.3 PIM

Protocol Independent Multicast (PIM) is the name


given to a common protocol that needs a unicast
routing protocol for its operation, but the unicast
protocol can be either a distance-vector protocol or a
link-state protocol. In other words, PIM needs to use
the forwarding table of a unicast routing protocol to
find the next router in a path to the destination, but
it does not matter how the forwarding table is
created. PIM has another interesting feature: it can
work in two different modes: dense and sparse.

21.27
Figure 221.14: Idea behind PIM-DM

21.28
Figure 221.15: Idea behind PIM-SM

21.29

You might also like