DIJKSTRA ALGORITHM IMPLEMENTATION ON FPGA CARD FOR TELECOM CALCULATIONS

In Information Technology networks for data packets coming from a source and arriving to the input of a network (WAN for example) according to specifications, the routing system must assign to the network the best and optimal path in order to avoid the congestion phenomenon.In this paper, we suggest a new approach for the implementation of the DIJKSTRA routing algorithm by using an FPGA development card (Xilinx), this is for accelerating the routing process of the IT networks,whatever the number of connected node where the network must provide combine flexibility andspeed.In our investigation, we considered the following: at the beginning, we present the routing system in the IT networks and explain the DIJKSTRA routing algorithm. We present the new implementation architecture, we do a simulation and present the obtained results and we compare them with the ordinary processors.