Robust recoverable path using backup nodes

Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk*, Johannes Hoogeveen, Erik van Ommeren

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We consider routing in networks in the presence of node failures. The focus is specifically on the single-node failure model, which captures the resilience of networks in a realistic fault setting. We introduce a model of recoverable routing, where we ask for an s-t-path that can be repaired easily and locally by assigning ‘backup nodes:’ when a node on the path fails, it is replaced by its backup node. We resolve the basic algorithmic and complexity questions for finding paths in this model, depending on the properties we require of the backup assignment. For some cases we provide polynomial-time algorithms, and for the others we prove NP-completeness and provide exponential-time algorithms. Lastly, we consider a problem variant where the path is given and ask for a backup assignment.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Pages95-106
Number of pages12
Volume9587
ISBN (Print)9783662491911
DOIs
Publication statusPublished - 2016
Event42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016 - Harrachov, Czech Republic
Duration: 23 Jan 201628 Jan 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9587
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016
Country/TerritoryCzech Republic
CityHarrachov
Period23/01/1628/01/16

Fingerprint

Dive into the research topics of 'Robust recoverable path using backup nodes'. Together they form a unique fingerprint.

Cite this