A study of issues relating to traffic restoration in wide area communication networks

In this paper, we compare two different criteria for the traffic restoration process at a node in a wide area communication network. The issue of the timing of the reconnection is compared with the issue of ordering the virtual circuits that need reconnection. In the first scheme, an algorithm is developed to minimize the amount of time the network is congested while the latter scheme tries to minimize the probability of blocking of calls during the reconnection process. The feasibility of implementing both these schemes simultaneously in a network is studied.<>