Robust traffic design for dynamic routing networks

The authors present traffic restoration design algorithms to attain a robust network for any facility link or node failure. Some of these algorithms were implemented on network models to compute the cost for doing traffic restoration for different traffic restoration level objectives. From their simulation studies, the authors found that with efficient use of trunk group diversity and at a reasonable incremental cost, one can obtain a robust network to respond to a major facility link or a node failure and still meet the network objectives. A similar approach based on the algorithms presented in this work has been proposed for design of the worldwide intelligent network.<<ETX>>