A heuristic technique for designing protection networks

This paper deals with the problem of allocating spare capacity to protect telecommunications traffic in a fully or partly-meshed transport network topology. The method discussed is applicable to any mesh-based restoration strategy, i.e. pre-planned make-good routes, centralised control, or distributed algorithms. An existing heuristic spare capacity allocation algorithm and a number of extensions are described