Survivability algorithms in MPLS and WDM optical networks

In modern ultra-wide bandwidth, high speed and high reliable communication networks, the failure of network components including equipment (such as routers) and transmission media (such as fibers) may cause a huge volume of data loss. Therefore network survivability mechanisms, by which the disrupted traffic upon failures can be restored, are crucial in network design and deserve thorough investigation. In this thesis, we propose some survivability approaches to survive failures in MPLS and WDM optical networks. MPLS is a promising technology that enables much faster failure recovery than conventional IP rerouting in IP networks. While the traditional MPLS path-based protection scheme is capacity efficient, it is relatively slow in restoration; on the other hand, while traditional MPLS link-based scheme has fast restoration speed, its capacity efficiency is low. In this thesis, we propose a new restoration scheme called UNIFR, which can provide fast restoration as link-based scheme while achieving better capacity efficiency than link-based scheme. We present a MPLS resilience framework that supports UNIFR and give two ILP formulations to solve the spare capacity optimization problem for UNIFR-based restoration model. Simulation study shows that the capacity efficiency of UNIFR-based model is much better than that of link-based model and close to that of path-based model. In WDM optical networks, although lots of pervious works have been done in both protection and restoration survivability techniques, to our best knowledge, little study focuses on improving the dynamic restoration success ratio. To address this problem, we first identify two restoration blocking types called primary holding and mutual competition. To address primary holding, we propose a dynamic routing and wavelength assignment algorithm for connection establishment that takes the future possible failures into consideration and choose route and wavelength for the working lightpath that could lead to higher chance of successful restoration for the potential failures. To address mutual competition, we present some heuristics ideas to increase restoration success ratio. Simulation shows that our algorithms can clearly reduce the restoration blocking probability while not affecting primary blocking probability and restoration speed much