Restoration by path concatenation: fast recovery of MPLS paths
From MaRDI portal
Publication:5138384
Recommendations
- Restoration by path concatenation, fast recovery of MPLS paths
- scientific article; zbMATH DE number 1717249
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- A survey of IP and multiprotocol label switching fast reroute schemes
- Prompt partial path optimization in MPLS networks
Cites work
Cited in
(12)- A restorable MPLS-based hose-model VPN network
- scientific article; zbMATH DE number 1717249 (Why is no real title available?)
- Restoration by path concatenation, fast recovery of MPLS paths
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Compact distance oracles with large sensitivity and low stretch
- Approximate distance sensitivity oracles in subquadratic space
- Approximate distance sensitivity oracles in subquadratic space
- New fault tolerant subset preservers
- Restorable shortest path tiebreaking for edge-faulty graphs
- Near optimal dual fault tolerant distance oracle
- A deterministic approach to shortest path restoration in edge faulty graphs
- Fault-tolerant approximate distance oracles with a source set
This page was built for publication: Restoration by path concatenation: fast recovery of MPLS paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138384)