Efficient Capacity Sharing in Path Restoration Schemes for Meshed Optical Networks

Efficient resource management in meshed optical networks is critical in order to support differentiated services in a cost competitive manner. In this document we propose and study several alternatives for dynamic selection of primary and restoration paths that are link and node disjoint. The focus is on algorithms where the bandwidth can be shared among restoration paths although other alternatives are considered too. Also the approach can provide that any pair of links from primary and restoration paths does not belong to the same SRLG (shared risk link group). This feature allows for an additional level of security in case of natural or man-made disasters.