In this paper, we present an alternative routing scheme which ensures that the network restores itself under any single link failure. In addition, our scheme has the advantage that restoration of the network occurs immediately on discovery of failure (without waiting for time consuming exchange of messages). An efficient heuristic algorithm, based on maximal-flow algorithm, is first used to partition the network into two parts (one carries the regular or primary traffic and the other is reserved to carry re-routed traffic in the event of failure). Then, we show how to use the results of the algorithm to actually find the alternative routes for a given call at the time of call setup.
展开▼
