MPLS restoration scheme using least-cost based dynamic backup path

DOI10.1007/3-540-47734-9_32MaRDI QIDQ2777263zbMATH OpenFDO

Authors Gaeil Ahn, Woojik Chun

Publication date 7 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2094/20940319

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Restoration by path concatenation: fast recovery of MPLS paths
• Restoration by path concatenation, fast recovery of MPLS paths
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
• PLR-based heuristic for backup path computation in MPLS networks

Cited in

(4)

• PLR-based heuristic for backup path computation in MPLS networks
• Routing bandwidth-guaranteed paths with restoration in label-switched networks
• Restoration by path concatenation, fast recovery of MPLS paths
• Restoration by path concatenation: fast recovery of MPLS paths

This page was built for publication: MPLS restoration scheme using least-cost based dynamic backup path

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