# Why Faster Algorithms May Not Be Needed for Link-State Routing

DevFeed: [Why Faster Algorithms May Not Be Needed for Link-State Routing](<https://devfeed.tech/articles/worth-reading-faster-than-dijkstra-11355.md>)

Original publisher: [Read original article](<https://blog.ipspace.net/2026/03/worth-reading-faster-than-dijkstra/>)

Published: 2026-03-03T06:43:00Z

Content type: opinion

Language: en

Sources: [ipSpace.net blog](<https://devfeed.tech/sources/ipspace-net-blog.md>)

Topics: [networking](<https://devfeed.tech/topics/networking.md>), [Routing (disambiguation)](<https://devfeed.tech/topics/routing.md>), [Algorithm](<https://devfeed.tech/topics/algorithm.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [article](<https://devfeed.tech/tags/article.md>), [network](<https://devfeed.tech/tags/network.md>), [routing](<https://devfeed.tech/tags/routing.md>), [worth-reading](<https://devfeed.tech/tags/worth-reading.md>)

## AI overview

Bruce Davie explains why replacing Dijkstra's algorithm in link-state routing protocols may be unnecessary. The article cites large routing areas and a 2000-node emulated network where Dijkstra's algorithm ran in 100 milliseconds in 2003.

## Source excerpt

Bruce Davie published a nice article explaining why it makes little sense to use an algorithm that's supposedly faster than Dijkstra's in link-state routing protocols. Other interesting data points from the article (and linked presentations): People are running (a few) thousands of routers in a single area Running Dijkstra's algorithm on an emulated network with 2000 nodes took 100 msec... in 2003 (page 18 of this NANOG presentation). It turns out (as I expected) that all the noise about the need for new routing protocols we were experiencing a few years ago was either due to bad implementations or coming from nerds looking for new toys to play with.