Implementation of Probabilistic Shortest Path Routing Algorithm in Routing Protocol

Abstract

In Computer networks, data transfer operations are fundamental aspects for networking and routing. Generally routing protocol performs the task between the nodes and sets up a path between the two nodes. It also has the liability of sharing information among the entire network from the source location to the destination location. For this purpose, the route linked between source nodes to destination node is to be found. Here we focus on finding the route between sources to the destination node through shortest path. The significance of this paper is to find the shortest path between two nodes (source node and destination node) in Open Shortest Path First Protocol (OSPF) using probabilistic shortest path routing algorithm which is altogether a new algorithm unlike Dijkstra’s shortest path or any other algorithm for finding shortest path. Further, here we implement the proposed algorithm and the Dijkstra’s algorithm to find the shortest path using C programming language. Finally, we present some numerical examples to explain the solution procedure.