Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alexandrovich PD, Yurievich TI (2016) Proactive backup scheme of routes in distributed computer networks. In: 2016 International siberian conference on control and communications (SIBCON)
Alexandrovich PD, Tsyganov IY (2016) Paired transitions algorithm of communication links in computer networks based on subnet routing method. In: 2016 5th Mediterranean conference on embedded computing (MECO). IEEE
Kini S, Ramasubramanian D, Kvalbein A, Hansen S (2009) Fast recovery from dual link failures in IP networks. In: INFOCOM
Kvalbein A, Cicic T, Gjessing S (2007) Post-failure routing performance with multiple routing configurations. In: Proceedings of the IEEE INFOCOM, Anchorage, AK, United States, pp 98–106
Wang J, Nelakuditi S (2007) IP fast reroute with failure inferencing. Technical report TR-2007-006. University of South Carolina
Zhong Z, Nelakuditi S, Yu Y, Lee S, Wang J, Chuah CN (2005) Failure inferencing based fast rerouting for handling transient link and node failures. In: IEEE global internet
Ramasubramanian S, Chandak A (2008) Dual-link failure resiliency through backup link mutual exclusion. IEEE/ACM Trans Netw 16(1)
Retvari G, Tapolcai J, Enyedi G, Csszr A (2011) IP fast reroute: loop free alternates revisited. In: IEEE INFOCOM, pp 2948–2956
Csikor L, Tapolcai J, Retvari G (2013) Optimizing IGP link costs for improving IP-level resilience with loop-free alternates. Comput Commun 36(6):645–655
Liu Y, Narasimha AL, Reddy A (2004) Fast rerouting scheme for OSPF/IS-IS networks. In: ICCCN
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Geethika, S., Sai Sree, I., Kumar Raju Alluri, B.K.S.P. (2019). A Reliable Routing Protocol with Backup Scheme in Wired Computer Networks. In: Sridhar, V., Padma, M., Rao, K. (eds) Emerging Research in Electronics, Computer Science and Technology. Lecture Notes in Electrical Engineering, vol 545. Springer, Singapore. https://doi.org/10.1007/978-981-13-5802-9_2
Download citation
DOI: https://doi.org/10.1007/978-981-13-5802-9_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-5801-2
Online ISBN: 978-981-13-5802-9
eBook Packages: EngineeringEngineering (R0)