Beruflich Dokumente
Kultur Dokumente
The demand is increasing for Internet, intranet, and multimedia applications in which one
sender transmits to a group of receivers simultaneously. Examples of these applications
include the following:
Transmitting a corporate message to all employees
Broadcasting video and audio, including interactive video for distance learning and
IPTV
Transmitting data from a centralized data warehouse to multiple departments
Communicating stock quotes to brokers
Computing collaboratively
Algorithmic trading floor applications using cloud computing
Subsequently, using IP multicast instead of unicast to distribute this information reduces
the overall network load and bandwidth consumption. This is a result of IP multicasts
simultaneous distribution of an IP data frame to a host group that is defined by a single
multicast IP address, or flow. To accomplish this same distribution with unicast would
require the source to send a unicast frame to each host independently.
Note: Multicast reduces overall network load and bandwidth by distributing traffic to
multiple end users simultaneously.
The following slides discuss IP multicast routing and its inherent advantages, functionality,
and configuration in campus network. We begin with an introduction to multicast and then
discuss the fundamentals of the IP multicast. We also discuss the important Layer 3 and
Layer 2 multicast protocols and the design recommendations for deploying multicast in
multilayer switched networks.
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
Multicast-capable routers and multilayer switches create distribution trees that control the
path that IP multicast traffic takes through the network to achieve loop-free forwarding.
Reverse Path Forwarding (RPF) is the mechanism that performs an incoming interface
check to determine whether to forward or drop an incoming multicast frame. RPF is a key
concept in multicast forwarding. This RPF check helps to guarantee that the distribution
tree for multicast is loop-free. In addition, RPF enables routers to correctly forward
multicast traffic down the distribution tree.
In unicast routing, traffic is routed through the network along the path from the single
source to the single destination host. A router that is forwarding unicast packets does not
consider the source address, by default; the router considers only the destination address
and how to forward the traffic toward the destination with the exception of specialized
CEF features. Upon receipt of unicast packets, the router scans through its routing table
for the destination address and then forwards a single copy of the unicast packet out the
correct interface to the destination.
In multicast forwarding, the source is sending traffic to an arbitrary group of hosts that is
represented by a single multicast group address. When a multicast router receives a
multicast packet, it determines which direction is the upstream direction (toward the
source) and which one is the downstream direction (toward the receivers). A router
forwards a multicast packet only if the packet is received on the correct upstream
interface determined by the RPF process.
Note, although routers build a separate IP multicast routing table, the RFP check is
dependent on the unicast IP routing table for determining the correct upstream and
downstream interfaces.
33
34
35
36
37
38
39
40
41
Unlike source trees, which have their root at the source, shared trees
use a single common root placed at some chosen point in the
network. This shared root is called a rendezvous point (RP). The
figure shows a shared unidirectional tree for the group 224.1.1.1 with
the root located at Router D. Source traffic is sent toward the RP on a
shared tree. The traffic is then forwarded down the shared tree from
the RP to reach all the receivers unless the receiver is located
between the source and the RP, in which case the multicast traffic is
serviced directly.
In the figure, multicast traffic from the sources, Hosts A and D, travels
to the root (Router D) and then down the shared tree to the two
receivers, Hosts B and C. Because all sources in the multicast group
use a common shared tree, a wildcard notation written as (*,G),
pronounced star comma G, represents the tree. In this case, *
means all sources, and G represents the multicast group. Therefore,
the shared tree shown in the figure is written as (*, 224.1.1.1).
42
43
Both source trees and shared trees avoid multicast traffic loops.
Routing devices replicate the multicast packets only where the tree
branches.
Members of multicast groups join or leave at any time; as a result,
the distribution trees update dynamically. When all the active
receivers on a particular branch stop requesting traffic for a particular
multicast group, the routers prune that branch from the tree and stop
forwarding traffic down it. If one receiver on that branch becomes
active and requests the multicast traffic, the router dynamically
modifies the distribution tree and starts forwarding traffic again.
Source trees have the advantage of creating the optimal path
between the source and the receivers. This advantage guarantees
the minimum amount of network latency for forwarding multicast
traffic. However, this optimization requires additional overhead
because the routers maintain path information for each source. In a
network that has thousands of sources and thousands of groups, this
overhead quickly becomes a resource issue on routers or multilayer
switches. Memory consumption and troubleshooting complexity from
the size of the multicast routing table are factors that network
designers need to take into consideration when designing multicast
networks.
Shared trees have the advantage of requiring the minimum amount
of state information in each router. This advantage lowers the overall
memory requirements and complexity for a network that allows only
44
44
45
46
47
48
shown in the figure, and the router, which does not have members or
receivers, sends the prune message to the upstream router.
A non-leaf router receives a prune message from all of its neighbors.
In summary, PIM-DM works best when numerous members belong to each
multimedia group. PIM floods the multimedia packet to all routers in the
network and then prunes routers that do not service members of that
particular multicast group.
Consider when planning multicast in the campus network that PIM-DM is
most useful in the following cases:
Senders and receivers are in close proximity to one another.
PIM-SM goes through a dense-mode flooding phase before fully
relying on the RP for multicast forwarding.
There are few senders and many receivers.
The volume of multicast traffic is high.
The stream of multicast traffic is constant.
Nevertheless, PIM-DM is not the method of choice for most campus
networks enterprise because of its scalability limitations and flooding
properties.
48
49
50
51
52
The second approach to multicast routing, PIM sparse mode (PIMSM), is based on the assumptions that the multicast group members
are sparsely distributed throughout the network and that bandwidth is
limited.
It is important to note that PIM-SM does not imply that the group has
few members, just that they are widely dispersed. In this case,
flooding would unnecessarily waste network bandwidth and could
cause serious performance problems. Therefore, PIM-SM multicast
routing protocols rely on more selective techniques to set up and
maintain multicast trees.
PIM-SM protocols begin with an empty distribution tree and add
branches only as the result of explicit requests to join the distribution.
The figure illustrates a sample of PIM sparse mode.
With PIM-SM, each data stream goes to a relatively small number of
segments in the campus network. Instead of flooding the network to
determine the status of multicast members, PIM-SM defines an RP.
When a sender wants to send data, it first does so to the RP. When a
receiver wants to receive data, it registers with the RP, as shown in
the figure. When the data stream begins to flow from sender to RP to
receiver, the routers in the path automatically optimize the path to
remove unnecessary hops. PIM-SM assumes that no hosts want the
multicast traffic unless they specifically ask for it. In PIM-SM, the
shared tree mode can be switched to a source tree after a certain
threshold to have the best route to the source. All Cisco IOS routers
53
and switches, by default, have the SPT threshold set to 0, such that the lasthop router switches to SPT mode as soon as the host starts receiving the
multicast, to take advantage of the best route for the multicast traffic.
Note: To clarify a common confusion, sparse-mode only uses the RP as a
initial point to forward multicast by default; configuration options exist to
foreword all traffic to the RP.
PIM-SM is optimized for environments where there are many multipoint data
streams. When planning for multicast deployments in the campus network,
choose PIM-SM with IP under the following scenarios:
There are many multipoint data streams.
At any moment, there are few receivers in a group.
The type of traffic is intermittent or busty.
53
54
55
56
PIM version 2 is a standards-based multicast protocol in the Internet Engineering Task Force (IETF). Cisco highly
recommends using PIM version 2 in the entire multilayer switched network. The Cisco PIM version 2 implementation
enables interoperability and transition between version 1 and version 2, although there are a few caveats. For example,
if a PIM version 2 router detects a PIM version 1 router, the version 2 router downgrades itself to version 1 until all
version 1 routers have been shut down or upgraded.
PIM version 2 uses the BSR to discover and announce RP-to-group mapping information for each group prefix to all the
routers in a PIM domain. This is the same function accomplished by Auto-RP. However, the BSR feature is part of the
PIM version 2 specifications because bootstrap messages are sent on a hop-by-hop basis, and a PIM version 1 router
prevents these messages from reaching all routers in a network. Therefore, if a network has a PIM version 1 router with
Cisco routers, it is best to use Auto-RP rather than the bootstrap mechanism. Nevertheless, Auto-RP is a standalone
protocol, separate from PIM version 1, and is Cisco proprietary. The BSR mechanism interoperates with Auto-RP on
Cisco routers.
A PIM version 2 BSR that is also an Auto-RP mapping agent automatically advertises the RP elected by Auto-RP. That
is, Auto-RP prevails in its imposition of a single RP on every router in the group.
In summary, PIM version 2 includes the following improvements over PIM version 1:
A single, active RP exists per multicast group, with multiple backup RPs. This single RP compares to multiple
active RPs for the same group in PIM version 1.
A BSR provides a fault-tolerant, automated RP discovery and distribution mechanism. Thus, routers dynamically
learn the group-to-RP mappings.
Sparse mode and dense mode are properties of a group, as opposed to an interface. Cisco strongly
recommends sparse-dense mode configurations.
PIM join and prune messages have more flexible encodings for multiple address families.
A more flexible hello packet format replaces the query packet to encode current and future capability options.
Register messages to an RP indicate whether they were sent by a border router or a designated router.
PIM no longer uses the IGMP protocol for transport; PIM version 2 uses standalone packets.
When planning for PIM deployments in the campus network, prefer to use PIM version 2 over PIM version 1.
Note: Several newer versions of PIM sparse-mode protocols are gaining popularity in campus networks. These
versions are outside the scope of this course:
Any Source Multicast (ASM), which uses RPs with either shortest path tree or shared tree.
Source Specific Multicast (SSM), which does not use RP and is designed using only shortest path tree.
Bidirectional PIM (Bi-dir PIM), which is based on shared trees only.
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85