This paper discusses the suitability of reconfigurable computing architectures to different network routing methods. As an
example of the speedup offered by reconfigurable logic, the implementation of Dijkstra’s shortest path routing algorithm is
presented and its performance is compared to a microprocessor-based solution.