Survivable routing using path criticality

Network criticality measures the robustness of a network to changes in topology, traffic demand, and faults. Recent research has shown that path selection according to network criticality metrics can lead to improved utilization and reduced blocking in mesh networks. In this paper we investigate the selection of survivable routes within the context of dynamic routing using weighted random-walk path criticality routing (WRW-PCR). To build backup paths for primary routes a shared backup path selection strategy is considered. Each link is characterized by its active bandwidth, backup bandwidth, and available capacity. The WRW-PCR algorithm is used to find paths with less sensitivity to traffic and topology changes. We present simulation results that demonstrate that path criticality routing results in much lower blocking than alternative routing algorithms.