CS 640 1

GROUP MEMBERS
Hafiz Syed Imran Haider (BCS02121088)
Muhammad Kamran Riaz (BCS02121093)
Umair hameed (BCS02121117)
OUTLINE
What is Unicasting?
What is multicasting?
Why we use multicasting?
IGMP
Spanning Tree
IP Multicast Routing protocol
CS 640 3
UNICASTING
In unicasting the router forwards the
received data through only one of its
interface.

CS 640 4
CS 640 5
MULTICASTING

In multicasting the router may forwards the received data through several of
its interface.

Multicast address identifies a particular transmission session
Network routers need to translate multicast addresses into host addresses

CS 640 6
CS 640 7
ONE TO MANY COMMUNICATION
Application level one to
many communication
8
IP multicast
S S
R
R
R
R
R
R
WHY MULTICAST
When sending same data to multiple receivers
better bandwidth utilization
less host/router processing
quicker participation
Application
Video/Audio broadcast (One sender)
Video conferencing (Many senders)
Real time news distribution
Interactive gaming
9
IP MULTICAST GROUP ADDRESS
Things are a little tricky in multicast since receivers
can be anywhere
Class D address space
high-order three 3bits are set
224.0.0.0 ~ 239.255.255.255
10
GETTING PACKETS TO END HOSTS
We havent treated general methods for this yet but the
problem is having both a unicast and multicast IP
only if they know there is at least one recipient for that
group on that network
Internet Group Management Protocol (IGMP)
11
INTERNET GROUP MANAGEMENT
PROTOCOL (IGMP)
Multicast communication means that a sender sends a message to a group
of recipients that are members of the same group. Each multicast router
needs to know the list of groups that have at least one loyal member related
to each interface. Collection of this type of information is done at two levels:
locally and globally. The first task is done by the IGMP protocol; the second
task is done by the multicast routing protocols.

CS 640 12
IGMP MESSAGES
CS 640 13
SPANNING TREE
Just enough connectivity so that only one path
between every pair of routers
A router copies an incoming packet only on the
interfaces part of the spanning tree
Packets replicated only when the tree branches
Source/Destination based routing

14

CS 640 15
15
IP MULTICAST ROUTING
Purpose: share Group information among
routers, to implement better routing for
data distribution
Distribution tree structure
Source tree
shared tree
16
SOURCE DISTRIBUTION TREE
17
Receiver 1
E
B A D F
Source
Notation: (S, G)
S = Source
G = Group
C
Receiver 2
S
R R
SHARED DISTRIBUTION TREE
18
Receiver 1
E
B A D F
Source
Notation: (*, G)
* = all sources
G = Group
C
Receiver 2
S1
R R
Shared Root
S2
SOURCE TREE CHARACTERISTICS
Source tree
More memory O (G x S ) in routers
optimal path from source to receiver,
minimizes delay
good for
small number of senders, many receivers
such as Radio broadcasting application
19
SHARED TREE CHARACTERISTICS
Shared tree
Less memory O (G) in routers
May have duplicate data transfer (possible duplication of a path
from source to root and a path from root to receivers)
good for
Environments where most of the shared tree is the same as the
source tree
Many senders with low bandwidth (e.g. shared whiteboard)
20
PROTOCOL TYPES
Dense mode protocol
DVMRP (Distance Vector Multicast Routing
Protocol)
PIM-DM (Protocol Independent Multicast,
Dense Mode)
Sparse mode protocol
Shared distribution tree and ACK type
PIM-SM (Protocol Independent Multicast,
Sparse Mode)
21
DVMRP

4 decision-making strategies
1. Flooding
2. Reverse Path Forwarding (RPF)
3. Reverse Path Broadcasting (RPB)
4. Reverse Path Multicasting (RPM)
22
FLOODING
When a router receives a multicast
packet for a group, it determines if it is
the first time it has seen the packet
Then, it forwards it on all interfaces
except the incoming interface.
Routers only need to store recently seen
packets

CS 640 23
RPF(REVERSE PATH FORWARDING)
To prevent loops, only one copy is forwarded; the other copies are
dropped.
In RPF, a router forwards only the copy that has traveled the
shortest path from the source to the router.
If a packet leaves the router and comes back again, it has not
traveled the shortest path.
24
RPF eliminates the loop in the
flooding process.
REVERSE PATH BROADCASTING
RPB guarantees that each network receives a copy of the
multicast packet without formation of loops
However, RPF does not guarantee that each network receives only
one copy
To eliminate duplication, we must define only one parent router
(designated parent router) for each network

CS 640 25
REVERSE PATH BROADCASTING
In RPB, for each source, the router sends the packet
only out of those interfaces for which it is the
designated parent
The designated parent router can be the router with
the shortest path to the source
Because routers periodically send updating packets
to each other (in RIP), they can easily determine
which router in the neighborhood has the shortest
path to the source.

CS 640 26
CS 640 27
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.
RPF AND RPB
CS 640 28
REVERSE PATH MULTICASTING
To increase efficiency, the multicast packet must
reach only those networks that have active members
for that particular group
RPM adopts the procedures of Pruning and Grafting
The designated parent router of each network is
responsible for holding the membership information
(through IGMP
CS 640 29
REVERSE PATH MULTICASTING
The router sends a prune message to the upstream router so
that it can prune the corresponding interface
That is, the upstream router can stop sending multicast
message for this group through that interface
Grafting
The graft message forces the upstream router to resume
sending the multicast messages


CS 640 30
CS 640 31
RPM adds pruning and grafting to RPB to
create a multicast shortest path tree that
supports dynamic membership changes.
ANY QUESTION
CS 640 32
CS 640 33