Lectures notes for 2010 - KTH

Multicast Routing - Steiner Tree’s
Assume source C and the recipients are A and D.
A
D
3
1
6
B
E
4
RPF Tree (4 links)
2
5
C
Figure 10: RPF vs. Steiner Tree
Seiner Tree (3 links)
• Steiner tree uses less resources (links), but are very hard to compute
(N-P complete)
• In Steiner trees the routing changes widely if a new member joins the
group, this leads to instability. Thus the Steiner tree is more a
mathematical construct that a practical tool.
A
D
3
1
6
B
E
4
2
5
C
Maguire Multicast Routing - Steiner Tree’s 8: 43 of 78
maguire@kth.se 2010.03.21 Internetworking/Internetteknik