Skip to Main Content
As the network is growing exponentially, challenges and issues also increases. They affect the performance of the network. Many factors contribute to improve the performance of the network. One such factor is finding the path quickly. In this paper, we are going to find a shortest path faster compared to Dijkstra's shortest path algorithm. We have introduced new ideas in building the end-to-end path. Various steps involved in finding the shortest path are refined. The simulated algorithm shows better results than the existing algorithm. We are sure that, the outcome of this paper reduces computation overhead and processing overload.