Implementation of Shortest Path for Networks Topology Using Matlab

Communication on interconnection networks is a fundamental problem that has to be solved optimally in order to optimize the usage of a parallel computer. One of the basic communication problems is k-k routing, in which every processing unit, PU, sends and receives exactly k packets. If the distribution of the destinations is homogeneous, then generally it is quite easy to perform the routing efficiently, but if the source/destination pattern is irregular, then trivial strategies may be lead to the congestion during the routing, resulting in packets getting delayed and overflowing buffers. The shortest path problem is concerned with finding the shortest path from a specified origin to a specified destination in a given network while minimizing the total cost associated with the path. The shortest path problem is an archetypical combinatorial optimization problem having widespread applications in a variety of settings. The shortest path problem has been investigated extensively. This paper develops the GUI based upon Dijkstra Algorithm for fast convergence of results. The proposed algorithm results are relatively independent of problem types (network sizes and topologies) for almost all source–destination pairs. Furthermore, The MATLAB simulation is carried for standard networks topologies varies from 4 to 30 nodes taken from IEEE and results were found to be very encouraging.