Let's test out this simple algorithm on a simple topology: A--B--C--D--E--F
where B and E are both configured as potential anchor nodes. To make it even simpler, suppose we set this up in the lab, and power up all six routers at the same time. Now there may be some moment at which: - A and C have seen LSPs from A, B, C, and D, but have have not seen the LSP from E. - D and F have seen the LSPs from C, D, E, and F, but have not seen the LSP from B. So A, B, and C will choose B as the anchor, enabling flooding on AB and BC. Also, D, E, and F will choose D as the anchor, enabling flooding on DE and EF. C will request flooding to be disabled on CD, since it leads away from B. D will request flooding to be disabled on DC, since it leads away from E. So there is no flooding on CD/DC. Now A, B, and C will never get an LSP from E, while D, E, and F will never get an LSP from B. Since CD/DC was never down, there is no reason to do a database exchange over it. It seems like the network is permanently broken, as the flooding topology is partitioned by CD/DC. Did I miss something? _______________________________________________ Lsr mailing list [email protected] https://www.ietf.org/mailman/listinfo/lsr
