Abstract
Industrial data transfer must rapidly recover from possible link failures to ensure reliability. The backup path mechanism is one of the transfer protections against multiple link failures. In this paper, we study a reliability-satisfied and hop-constrained backup path model that strives to reduce network capacity consumption under constraints on the reliability and maximum hop number of the backup path. The constraint on the maximum hop number is used to ensure the reliability and delay of a backup path. We propose an approximation algorithm to solve the dynamic backup path arrangement problem that is NP-hard.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
