Hi all, Here’s another counter example. As with the previous one, the network has two portions: A and B. Subnetwork A has nodes A1, A2, A3, A4, ... and subnetwork B has nodes B1, B2, B3, B4, ….
Nodes A1, A2, B1, and B2 are running algorithm X. They collectively decide that flooding between the two subnetworks should happen on links (A3, B3) and (A4, B4) and they prune (A1, B1) and (A2, B2) from the flooding topology. Nodes A3, A4, B3, and B4 are running algorithm Y. They collectively decide that flooding between the two subnetworks should happen on links (A1, B1) and (A2, B2) and they prune (A3, B3) and (A4, B4) from the flooding topology. As a result, the flooding topology between subnetwork A and B is partitioned. Tony
_______________________________________________ Lsr mailing list -- [email protected] To unsubscribe send an email to [email protected]
