Multicast routing [2]
l Distance vector:
– need next hop
information
– (or use poisoned
reverse)
l Link state:
– construction of all SP
trees for all nodes
possible
– “tie-break” rules
required
•  Second refinement
•  eliminate duplicates
•  need routing information