Dijkstra's Shortest Path Routing Algorithm in Reconfigurable Hardware

Authors:
Matti Tommiska;Jorma Skyttä
Affiliations:
-;-
Venue:
FPL '01 Proceedings of the 11th International Conference on Field-Programmable Logic and Applications
Year:
2001

Citing 5
Cited 1

Data networks

Data networks
Data structures and algorithm analysis in C

Data structures and algorithm analysis in C
Computer networks (3rd ed.)

Computer networks (3rd ed.)
Digital System Design with VHDL

Digital System Design with VHDL
Data and Computer Communications

Data and Computer Communications

Mathematical limits of parallel computation for embedded systems

Proceedings of the 16th Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.