Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Recommendations
Cited in
(15)- Physical network design to facilitate capacity reallocation
- Routing bandwidth-guaranteed paths with restoration in label-switched networks
- A restorable MPLS-based hose-model VPN network
- A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
- scientific article; zbMATH DE number 1717249 (Why is no real title available?)
- Restoration by path concatenation, fast recovery of MPLS paths
- scientific article; zbMATH DE number 2088587 (Why is no real title available?)
- Network protection by single and failure-dependent backup paths -- modelling and efficiency comparison
- Generalized elastic flow rerouting scheme
- Local Fast Segment Rerouting on Hypercubes
- Restoration by path concatenation: fast recovery of MPLS paths
- Network restoration
- Unambiguous switching link group failure localization in all-optical networks
- A survey of IP and multiprotocol label switching fast reroute schemes
- Bandwidth sensitive fast failure recovery scheme for Metro Ethernet
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313013)