Abstract
Recently, a single-link failure protection scheme using protection tree has been proposed in [6].This scheme is scalable in that the protection tree can be adjusted dynamically as the network topology changes. A drawback of this scheme is that it may not be able to find a backup path for certain network links even if the network is 2-connected. In this paper, we first present a new protection tree scheme that can recover from any single-link failure in a 2-connected network. We then give an Integer Linear Program (ILP) formulation to compute a protection tree and allocate spare capacity on the network links so that the total spare capacity required is minimized. Finally, we present a distributed algorithm for fast double-link failure restoration using a protection tree. Simulation results show that around 70% of the double-link failures can be restored by our scheme even though the spare capacity in the network is planned for single-link failures. In addition, our scheme can achieve almost 100% restorability for double-link failures when spare capacity in the network is sufficiently large.
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.
