Virtual path routing for survivable ATM networks
IEEE/ACM Transactions on Networking (TON)
Fast restoration of real-time communication service from component failures in multi-hop networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scaling of multicast trees: comments on the Chuang-Sirbu scaling law
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
IEEE Communications Magazine
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A hybrid fault-tolerant algorithm for MPLS networks
WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications
Applicability of resilient routing layers for k-fault network recovery
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Design and Evaluation of Techniques for Resilience and Survivability of the Routing Node
International Journal of Adaptive, Resilient and Autonomic Systems
| Hi-index | 0.00 |
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove that a shortest path in a network after removing k edges is the concatenation of at most k + 1 shortest paths in the original network.The theory is then combined with efficient path concatenation techniques in MPLS (multi-protocol label switching), to achieve powerful schemes for restoration in MPLS based networks. We thus transform MPLS into a flexible and robust method for forwarding packets in a network.Finally, the different schemes suggested are evaluated experimentally on three large networks (a large ISP, the AS graph of the Internet, and the full Internet topology). These experiments demonstrate that the restoration schemes perform well in actual topologies.