Optimization for minimizing fault localization time in all-optical networks

Abstract

The limited perimeter vector matching (LVM) protocol is a novel fault localization protocol for localizing single-link failures in all-optical networks. In this paper, we study the optimization problem to minimize fault localization time when applying the LVM protocol to static all-optical networks, where traffic demands (or lightpath requests) are known a priori. Given the traffic demands, the optimization problem is to find a traffic distribution so that the time for localizing a failed link can be minimized. We formulate the problem into an integer linear programming problem and use CPLEX to solve the problem. We show through numerical results that by optimizing the traffic distribution the fault localization time can be effectively minimized and is below the OSPF localization time (40 msec) in traditional IP networks.