Dijkstra’s Shortest Path Routing Algorithm in Reconfigurable Hardware-Reference-Cited by-同舟云学术

Dijkstra’s Shortest Path Routing Algorithm in Reconfigurable Hardware

Published:2001 Issue: Volume: Page:653-657
ISSN:0302-9743
Container-title:Field-Programmable Logic and Applications
language:
Short-container-title:

Author:

Tommiska Matti,Skyttä Jorma

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44687-7_73

Reference13 articles.

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

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

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

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

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

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analysis and Construction of Hardware Accelerators for Calculating the Shortest Path in Real-Time Robot Route Planning;Electronics;2024-06-02

2. A Fast Scalable Hardware Priority Queue and Optimizations for Multi-Pushes;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

3. Strategy for the Identification of Optimal Network Distribution Through Network Reconfiguration Using Graph Theory Techniques − Status and Technology Review;Journal of Electrical Engineering & Technology;2022-07-19

4. OMNeT++ Framework for Simulation of Centralized and Distributed Algorithms in Multi-Hop Networks;Advances in Wireless Technologies and Telecommunication;2022

5. NATR: A New Algorithm for Tracing Routes;Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering