Sufficient conditions for protection routing in IP networks

DOI10.1007/s11590-012-0455-yzbMath1269.90134OpenAlexW2162784824WikidataQ58033124 ScholiaQ58033124MaRDI QIDQ1947622

János Tapolcai

Publication date: 23 April 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0455-y

zbMATH Keywords

node-connectivityIP fast reroute

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Related Items (5)

Constructing dual-CISTs of folded divide-and-swap cubes ⋮ Reliability analysis based on the dual-CIST in shuffle-cubes ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing

Cites Work

• Mathematical aspects of network routing optimization.
• Edge-Disjoint Spanning Trees of Finite Graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Unnamed Item
• Unnamed Item

This page was built for publication: Sufficient conditions for protection routing in IP networks