Optimization of failure recovery in high-speed networks

MaRDI QIDQ5494207zbMATH OpenFDO

Authors Terence T. Y. Kam, Dong-Soo Kim

Publication date 17 October 2006

zbMATH Keywords

digital networksreliabilityshortest-path rerouting methodtelecommunications

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Traffic problems in operations research (90B20) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Network restoration
• Optimal Routing Designs in Self‐healing Communications Networks
• Distributed Computing - IWDC 2003
• A service recovery method based on Bellman dynamic programming
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic

Cited in

(2)

• A service recovery method based on Bellman dynamic programming
• Mathematical approach for restoration algorithm in virtual private network with QoS paths

This page was built for publication: Optimization of failure recovery in high-speed networks

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