Restoration by path concatenation: fast recovery of MPLS paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
An efficient fault-tolerant approach for MPLS network systems
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
A rerouting scheme with dynamic control of restoration scope for survivable MPLS network
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
A fast path recovery mechanism for MPLS networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
IEEE Communications Magazine
| Hi-index | 0.00 |
In this paper we present a new fault tolerant, path maintaining, algorithm for use in MPLS based networks. The novelty of the algorithm lies upon the fact that it is the first to employ both path restoration mechanisms typically used in MPLS networks: protection switching and dynamic path rerouting. In addition, it is the first algorithm to adequately satisfy all four criteria which we consider very important for the performance of the restoration mechanisms in MPLS networks: fault recovery time, packet loss, packet reordering and tolerance of multiple faults. Simulation results indicate the performance advantages of the proposed hybrid algorithm (with respect to the four criteria), when compared with other algorithms that employ only one of the two restoration mechanisms.