An efficient heuristic for the design of a survivable network architecture for dynamic routing

We investigate network planning and design under volatile conditions of link failures and traffic overload. Given the end-to-end traffic requirements, we generate a maximum spanning tree that can carry the traffic of any one origin-destination pair. The maximum spanning tree is augmented to handle any two simultaneous link failures or congestions. Then the augmented maximum spanning tree is synthesized by the algorithm of Gomory and Hu (1961) on the physically diverse links. We prove that the resulting network can provide full protection for the original network in the case of any two link failures unless both are from the maximum spanning tree. Using a linear programming optimization model, we update the synthesized network to handle any two link failures (or congestions) of the original network