Method for rapid recovery path computation on mesh IP network

We focus on a method of computing recovery path routes in a mesh IP network, which is expected to be used when unforeseen massive failure or disaster occurs. We introduce the concept of “path-group” to differentiate recovered paths according to their priority. We assign a priority to a path-group in the concept. The routes for path-groups are computed for recovery in the order of their priority. The heuristic path-group computation algorithm based on the column-generation approach is applied to a nationwide network in the field that has a typical scale. We evaluate the algorithm in terms of the time taken to compute recovery path routes. In this paper, we provide experimental simulation results under various network conditions to show the feasibility of the heuristic algorithm.