Print Email Facebook Twitter An Overview of Algorithms for Network Survivability Title An Overview of Algorithms for Network Survivability Author Kuipers, F.A. Faculty Electrical Engineering, Mathematics and Computer Science Department Network Architectures and Services Date 2012-12-31 Abstract 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. To reference this document use: http://resolver.tudelft.nl/uuid:b0bbc8a3-b437-4275-b74f-09a31d2d5465 DOI https://doi.org/10.5402/2012/932456 Publisher Hindawi Publishing Corporation ISSN 2090-4355 Source International Scholarly Research Network ISRN Communications and Networking, Volume 2012, Article ID 932456 Part of collection Institutional Repository Document type conference paper Rights (c) 2012 F. A. KuipersThis is an open access article Files PDF ISRN2012.pdf 822.35 KB Close viewer /islandora/object/uuid:b0bbc8a3-b437-4275-b74f-09a31d2d5465/datastream/OBJ/view