Sufficient conditions for protection routing in IP networks

DOI10.1007/S11590-012-0455-YzbMATH Open1269.90134OpenAlexW2162784824WikidataQ58033124 ScholiaQ58033124MaRDI QIDQ1947622FDOQ1947622

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge-Disjoint Spanning Trees of Finite Graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Mathematical aspects of network routing optimization.

Cited In (8)

• A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing
• Constructing dual-CISTs of folded divide-and-swap cubes
• Constructing tri-CISTs in shuffle-cubes
• Loop-free traffic engineering with path protection in MPLS VPNs
• A novel path protection scheme for MPLS networks using multi-path routing
• Reliability analysis based on the dual-CIST in shuffle-cubes

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

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