Restoration by path concatenation: fast recovery of MPLS paths

DOI10.1007/s00446-002-0080-6zbMath1448.68173OpenAlexW4251704063MaRDI QIDQ5138384

Anat Bremler-Barr, Michael Merritt, Haim Kaplan, Edith Cohen, Yehuda Afek

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-002-0080-6

zbMATH Keywords

restorationMPLSOSPFshortest-path problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

Compact distance oracles with large sensitivity and low stretch

Cites Work

• Unnamed Item
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension

This page was built for publication: Restoration by path concatenation: fast recovery of MPLS paths