An Overview of Algorithms for Network Survivability

Conference paper (2012)

Authors

Department
Network Architectures and Services (EEMCS) (TU Delft)
Copyright: This is an open access article
DOI: https://doi.org/doi:10.5402/2012/932456
More Info
expand_more

Published Date

31-12-2012

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

International Scholarly Research Network ISRN Communications and Networking, Volume 2012, Article ID 932456

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Network Architectures and Services

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.

Files

ISRN2012.pdf
(pdf | 0.803 Mb)