Title: AN EFFICIENT ALGORITHM FOR SHORTEST COMPUTER NETWORK PATH

Issue Number: Vol. 6, No. 3
Year of Publication: Jul - 2016
Page Numbers: 213-218
Authors: Muhammad Asif Mansoor, Taimoor Karamat
Journal Name: International Journal of Digital Information and Wireless Communications (IJDIWC)
- Hong Kong
DOI:  http://dx.doi.org/10.17781/P002089

Abstract:


To find the shortest path in computer network problem is always a challenge for the network designers and many algorithms have been developed in past to solve this problem. One of these algorithms is the quantum classical algorithm that is the possibly fastest algorithm due to its wave like properties and it works faster with different operations. An algorithm is usually called an efficient algorithm if it takes less computation time than other algorithms. One of the popular algorithms for finding the shortest network path is Dijkstra’s algorithm. In this paper an efficient algorithm is presented to find shortest network path and its comparison with already developed algorithms which are Dijkstra’s algorithm and Dynamic Dijkstra’s algorithm. Along this simulation results are generated and proved that the proposed algorithm has improved the performance for shortest network path.