"The specification for OSPF (Open Shortest Path First (OSPF), one of two dominant link-state routing protocols (Intermediate System-to-Intermediate System, aka IS-IS, is the other). Guidance to implementors of OSPF is unusually detailed and basically tells them to use Dijkstra's algorithm. And that is what most implementations have done for decades, with a few minor improvements through the years to speed up the implementation but no real change to the fundamentals."
"The new algorithm is no minor tweak to Dijkstra's but a significantly different approach. Its headline claim is that, whereas Dijkstra requires a sorting operation, and thus is only able to perform as well as the best sorting algorithm, this new approach "breaks the sorting barrier". That is, it avoids the need for sorting and is able to deliver better bounds on performance than Dijkstra."
Researchers propose a new method for finding shortest paths that claims improved performance over Dijkstra's algorithm. Dijkstra's algorithm, published in 1959, predates packet switching and remains the specified method for OSPF and commonly used in implementations with only minor optimizations. The new algorithm avoids the sorting operation central to Dijkstra's approach, claiming to "break the sorting barrier" and to deliver better performance bounds. The paper passed peer review at a top-tier conference, suggesting the theory is sound. Practical relevance depends on real routing system scaling limits and other implementation considerations. Two main issues arose when assessing implications.
Read at Theregister
Unable to calculate read time
Collection
[
|
...
]