A Scalable Path Protection Mechanism for Guaranteed Network Reliability Under Multiple Failures

We propose two versions of Link Failure Probability (LFP) based backup resource sharing algorithms, namely LFP based First-Fit algorithm, and LFP based Best-Fit algorithm for Generalized Multi-Protocol Label Switching networks. Customers' availability requirements are met by adjusting the availability of the protection paths with different sharing options. Information required for calculating the availability of both the working, and protection paths can be collected along the specific working, and protection paths, thus avoiding the requirement for flooding. This makes our algorithms scalable for a large network. Our algorithms work consistently against both single, and multiple failures. Furthermore, we propose extensions for the existing signaling protocols to demonstrate that our proposed algorithms require minimum changes to the existing protocols. Simulation results show that our proposal performs better than the conventional Dedicated Path Protection schemes in terms of Call Acceptance Rate, and Total Bandwidth Consumption. Finally, by comparing simulation results to analytical results for a simplified network, we provide some insights into the correctness, and efficiency of our proposed algorithms