An Overview of Algorithms for Network Survivability. (5th December 2012)

• Record Type: Journal Article
• Authors: Kuipers, F. A.
• Other Names: Kubota H. Academic Editor.; Listanti M. Academic Editor.
• Is Part Of: ISRN communications and networking. Volume 2012(2012)
• Publication Date: 2012-12-05
• Subjects: Communication -- Periodicals; Computer networks -- Periodicals; Telecommunication -- Periodicals; Communication; Computer networks; Telecommunication; Electronic journals; Electronic journals; Periodicals; 004.6
• DOI: 10.5402/2012/932456
• Languages: English
• ISSNs: 2090-4355

Abstract

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.