Toward fast calculation of communication paths for resilient routing

DOI10.1002/NET.21789WikidataQ62048694 ScholiaQ62048694MaRDI QIDQ6496360FDOQ6496360

Authors: Kanstantsin Myslitski, Jacek Rak, Łukasz Kuszner 

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

Recommendations

• Optimal routing with failure-independent path protection
• Distributed algorithms for computing shortest pairs of disjoint paths
• Resilient capacity-aware routing
• Finding disjoint paths with related path costs
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

zbMATH Keywords

optimizationnetwork resiliencesurvivable routingend-to-end communications resiliencefailures of network nodes/linksfast computation of communication paths

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
• The theory of graphs. Translated from the 1958 French edition by Alison Doig.
• A quick method for finding shortest pairs of disjoint paths

Cited In (1)

• Efficient heuristics for determining node-disjoint path pairs visiting specified nodes

This page was built for publication: Toward fast calculation of communication paths for resilient routing

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