Dijkstra's algorithm is a centralized routing algorithm ... node to find the shortest path between the starting node and destination node. The Distance Vector routing algorithm is a decentralized ...

Dijkstra's Algorithm focuses on finding the shortest path from a single source to all other nodes, using a priority queue to explore the nearest nodes first. Distance Vector Routing focuses on ...

Abstract: Packet switching of data in networks is done by either the distance-vector or the link-state routing protocols. These protocols use the Bellman-Ford and the Dijkstra's algorithms ...

In this paper, we propose an adaptive routing algorithm based on Multiple-path-finding Dijkstra's and Q-learning algorithm (abbreviated as "Dijkstra-Q") in silicon photonic interconnect on chip, at ...