In this paper we propose the novel concept of a region protection/ restoration, where one backup path protects a certain region of an active path. We show that using the region protection/restoration we can keep both restoration times and network resource utilization ratio at the reasonable level. Since the optimization problem of finding working and backup paths is NP-complete, we developed the heuristic algorithm. We show that in the worst case our algorithm gave network resource utilization ratio only about 3.9 percent higher compared to the optimal one returned by the CPLEX program. Results of the U.S. Long-Distance Network modeling show that region protection gives a good compromise between path and link protection. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Molisz, W., & Rak, J. (2005). Region protection/restoration scheme in survivable networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3685 LNCS, pp. 442–447). https://doi.org/10.1007/11560326_37
Mendeley helps you to discover research relevant for your work.