A METHOD TO FIND SHORTEST RELIABLE PATH BY HARDWARE TESTING AND SOFTWARE IMPLEMENTATION

Abstract This research paper is about shortest reliable path algorithms of routing in transportation networks. Efficient management of networks requires that the shortest route from one point (node) to another is known. It is often necessary to be able to determine alternative routes through the network, in case any part of the shortest path is damaged or busy which the computation of shortest paths is one of the most fundamental problems. It also focuses in finding the shortest reliable path algorithm. We need to find the path distance from the source to destination which is reliable and found in an optimized way considering the network constraints. Keywords: Networking, Path finder, shortest path, Reliable path, Shortest Reliable path, Network Cable testing 1. Introduction There are some problems which exist in the current available in networks; this problem grows larger as the network grows. The first one is an efficient use of bandwidth that minimizes the transfer delay of packets between nodes to ensure the shortest end-to-end delay for packet transmission from source to destination. The second challenge is the ability to maintain data flow around permanent and transient node or link failures ensuring the maximum delivery rate of packets from source to destination. The final challenge is to efficiently use energy while maximizing delivery rate and minimizing end-to-end delay. The paper concentrates on an attempt of finding an algorithm or method which will help in removing the hardware oriented defects or faults which occurs in the networks after finding the shortest path, and the data is transferred from the source to the destination. The following sections will talk about both the hardware oriented tests, mostly tests performed on the cables which connect the source and the destination. Also the paper discusses about the valid algorithm for finding the shortest path.