In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may not be effective in multilayer networks. In this paper, we introduce the problem of maximizing the connectivity of layered networks. We show that connectivity metrics in layered networks have significantly different meaning than their single-layer counterparts. Results that are fundamental to survivable single-layer network design, such as the Max-Flow Min-Cut Theorem, are no longer applicable to the layered setting. We propose new metrics to measure connectivity in layered networks and analyze their properties. We use one of the metrics, Min Cross Layer Cut, as the objective for the survivable lightpath routing problem and develop several algorithms to produce lightpath routings with high survivability. This allows the resulting cross-layer architecture to be resilient to failures between layers. Index Terms-Connectivity, cross-layer survivability, disjoint paths, lightpath routing, max-flow, min-cut, multicommodity flow, survivable path set.
REF introduced certain connectivity metrics for layered networks and provided ILP formulations for the lightpath routing problem satisfying these metrics.
Cross-Layer Survivability in WDM-Based Networks
IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking
Computer Science