• SHORTEST PATH IDENTIFICATION USING THE MINIMUM HOP COUNT AND MAXIMUM BANDWIDTH CONSTRAINED BASED ALGORITHM IN NOC

Abstract

The Shortest path problems are one of the network flow optimization problems with large number of applications in various fields. Conventional techniques cannot be used for solving the shortest paths in a large network as they are too slow and require large number of storage. Finding the multiple shortest path gives the optimal solution in case of any fault occurred in a single shortest path in the run-time dimension. The proposed algorithm uses the fuzzy, shortest path algorithm and widest shortest path algorithm to identify the multiple shortest paths. Increased reliability, high throughput and high packet delivery ratio are achieved using the proposed algorithm.