 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
• |
Source or Shortest Path trees
|
|
|
|
• |
More
resource intensive; requires more state n(S x G)
|
|
|
|
• |
You
get optimal paths from source to all receivers, minimizes delay
|
|
|
• |
Best
for one-to-many distribution
|
|
|
• |
Shared or Core Based trees
|
|
|
|
• |
Uses
less resources; less memory n(G)
|
|
|
|
• |
You
may get sub optimal paths from source to all receivers,
|
|
|
|
depending
on topology
|
|
|
|
• |
The
RP (core) itself and its location may affect performance
|
|
|
|
• |
Best
for many-to-many distribution
|
|
|
|
• |
May
be necessary for source discovery (PIM-SM)
|
|