A Reliable Routing Protocol with Backup Scheme in Wired Computer Networks

The main challenges in wired computer networks are transferring data packets through the most reliable path and optimizing the time taken for dynamic recalculation of the backup route during the path failure. In this paper, the path with the largest number of reliable links is considered as the best path. The link reliability is decided based on several parameters like packet delivery ratio, flow capacity, bandwidth, queue capacity of the link, delay and throughput. For each link, the cost is assigned in terms of reliability using the proposed cost function. Data is sent through the calculated reliable path, thereby avoiding path failure to the maximum extent possible. If there is a failure in the path during packet transmission, the backup path is dynamically calculated by considering different scenarios. The effectiveness of the proposed protocol is proved by simulation results.