Robust recoverable path using backup nodes

DOI10.1007/978-3-662-49192-8_8MaRDI QIDQ2794347zbMATH OpenOpenAlexWikidataFDO

Authors Marjan Van Den Akker, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren, Hans L. Bodlaender

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/328199

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Single backup table schemes for shortest-path routing
• scientific article; zbMATH DE number 2086939
• Building edge-failure resilient networks
• Rerouting Flows when Links Fail
• Rerouting flows when links fail

This page was built for publication: Robust recoverable path using backup nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794347)