Skip to main content
SpringerLink
Log in
Book cover

International Conference on Field Programmable Logic and Applications

FPL 2001: Field-Programmable Logic and Applications pp 653–657Cite as

Dijkstra’s Shortest Path Routing Algorithm in Reconfigurable Hardware

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2147))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Tredennick: ”Technology and Business: Forces Driving Microprocessor Evolution”, Proceedings of the IEEE, Vol. 83, No. 12, December 1995, pp. 1641–1652.

    Article  Google Scholar 

  2. A. Alles: ATM Internetworking. Cisco Systems, Inc. 1995.

    Google Scholar 

  3. W. Stallings: Data and Computer Communications. Prentice-Hall, 1999.

    Google Scholar 

  4. A. Tanenbaum: Computer Networks. Prentice-Hall, 1996.

    Google Scholar 

  5. M. Tommiska: ”Reconfigurable Computing in Communications Systems”, Licentiate of Sciences Thesis, Helsinki University of Technology, 1998, pp. 46–50.

    Google Scholar 

  6. E. Dijkstra: ”A Note on Two Problems in Connexion with Graphs”, Numerische Mathematik, Vol. 1, 1959, pp. 269–271.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Moy: ”OSPF Version 2, RFC 2328”, May 1998.

    Google Scholar 

  8. D. Bertsekas, R. Gallager: Data Networks. Prentice-Hall, 1987, pp. 297–421

    Google Scholar 

  9. M.A. Weiss: Data Structures and Algorithm Analysis in C. The Benjamin/Cummings Publishing Company, Inc. 1993, pp. 281–343

    Google Scholar 

  10. M. Zwolinks: ”Digital System Design and VHDL”, Prentice-Hall 2000.

    Google Scholar 

  11. FPGA Express User’s Manual, 2000, Synopsys Corporation.

    Google Scholar 

  12. FLEX 10K Embedded Programmable Logic Family Data Sheet, ver. 4.02, May 2000, Altera Corporation.

    Google Scholar 

  13. Quartus Programmable Logic Development System & Software, ver. 1.01, May 1999, Altera Corporation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Signal Processing Laboratory, Helsinki University of Technology, Otakaari 5A, FIN-02150, Finland

    Matti Tommiska & Jorma Skyttä

Authors
  1. Matti Tommiska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorma Skyttä
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building Mayfield Road, EH9 3JZ, Edinburgh, UK

    Gordon Brebner

  2. School of Electrical and Electronic Engineering, Queen’s University of Belfast, Ashby Building Stranmillis Road, BT9 5AH, Belfast, UK

    Roger Woods

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tommiska, M., Skyttä, J. (2001). Dijkstra’s Shortest Path Routing Algorithm in Reconfigurable Hardware. In: Brebner, G., Woods, R. (eds) Field-Programmable Logic and Applications. FPL 2001. Lecture Notes in Computer Science, vol 2147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44687-7_73

Download citation

  • DOI: https://doi.org/10.1007/3-540-44687-7_73

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42499-4

  • Online ISBN: 978-3-540-44687-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation