Loops in OSPF
In his original conference paper, Garcia-Lunes who did a lot of work on DUAL as used by EIGRP states not only that the algorithm is loop free at all times, but also that OSPF and in fact all link-state algorithms are not entirely loop-free. It was published in 1993 though and I'm not sure if that is still true.
http://ccrg.soe.ucsc.edu/publications/jj.dual.ton93.pdf
Firstly doesn't EIGRP use split horizon to prevent loops, indicating DUAL isn't loop-free at all times?
And is the full view of the topology that's formed by OSPF routers not enough to prevent loops?
http://ccrg.soe.ucsc.edu/publications/jj.dual.ton93.pdf
Firstly doesn't EIGRP use split horizon to prevent loops, indicating DUAL isn't loop-free at all times?
And is the full view of the topology that's formed by OSPF routers not enough to prevent loops?