الفهرس 
Title :A hardware implementation of general purpose shortest path processor using FPGA
SummaryOnly 14 pages are availabe for public view
 |  | from | 102 |  |  |
| | | from | 102 | | |
Abstract
The shortest path problem is how to find the best metric between multiple paths. As an example in this field is what is done when someone goes from home to work, sometime by select the shortest path, sometime by select the longest path but with a higher speed limit, and other times by predicting traffic to determine which is the suitable path between home and work, likewise Open Shortest Path First (OSPF), it is a routing protocol used to find and calculate the correct route for packets crossing the IP networks. It was introduced by the Internet Engineering Task Force to serve as an Interior Gateway Protocol replacing RIP; OSPF is an example of finding the solution for the shortest path problem by using Dijkstra algorithm, The proposed work is to find the shortest path with a hardware co-processor rather than using a software solution to avoid many problems with the current software solution and has a higher performance, presenting a hardware solution for OSPF will extend the diversity of applications which will need the OSPF protocol outside computer networking science