Table of Contents
ISRN Communications and Networking
Volume 2012, Article ID 932456, 19 pages
Review Article

An Overview of Algorithms for Network Survivability

Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands

Received 4 September 2012; Accepted 25 September 2012

Academic Editors: H. Kubota and M. Listanti

Copyright © 2012 F. A. Kuipers. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Network survivability—the ability to maintain operation when one or a few network components fail—is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding disjoint paths. We present a concise overview of network survivability algorithms, where we focus on presenting a few polynomial-time algorithms that could be implemented by practitioners and give references to more involved algorithms.