Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm

Abstract

The shortest path problem is to find a path between two vertices on a given graph, such that the sum of the weights on its constituent edges is minimized. The classic Dijkstra's algorithm was designed to solve the single source shortest path problem for a static graph. It works starting from the source node and calculating the shortest path on the whole network. This work aims to develop a Hybrid algorithm Dijkstra's-Floyd Warshall algorithm to solve entropy maximization routing protocol problem. The algorithm has to find the shortest path between the source and destination nodes. Route guidance algorithm is use to find best shortest path in routing network, this is poised to minimize costs between the origin and destination nodes. The proposed algorithm is compared with the existing in order to find the best and shortest paths.