Network restoration under dual failures using path-protecting preconfigured cycles

Abstract

This paper presents a design algorithm for networks with a restoration mechanism that provides end-to-end path protection to a set of demands with specified working routes, where demands must survive one or two failures in optical networks and these failures may occur almost instantaneously. Each of the demands protected from two failures is assigned two restoration routes and restoration wavelengths on a cycle. A demand protected from a single failure is assigned one restoration route and restoration wavelengths on a cycle. These assignments are preconfigured so that switching and wavelength conversions are not needed at intermediate nodes of restoration routes. Splitting of demand across multiple restoration routes upon a failure occurrence is not allowed. The algorithm generates a large number of candidate Path-Protecting Preconfigured Cycles (PP-PCs). A candidate cycle may provide protection to a mix of demands requiring different protection levels, where demands may share under certain conditions restoration wavelengths even if they are exposed to common failure scenarios and have overlapping restoration routes. A near-optimal set of preconfigured cycles is selected from among all candidates, attempting to minimize the total cost of restoration wavelengths while ensuring that each demand is assigned to a single preconfigured cycle. This is achieved by solving a set covering problem followed by deleting duplicate demand assignments and by resolving wavelength assignment conflicts.