A fast path recovery mechanism for MPLS networks

Authors:
Jenhui Chen;Chung-Ching Chiou;Shih-Lin Wu
Affiliations:
Department of Computer Science and Information Engineering, Chang Gung University, Taoyuan, Taiwan, R.O.C.;BroadWeb Inc., Hsin-Chu, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, Chang Gung University, Taoyuan, Taiwan, R.O.C.
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 4
Cited 1

Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
Improving the Reliability of the Label Distribution Protocol

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Designing multiprotocol label switching networks

IEEE Communications Magazine
Building reliable MPLS networks using a path protection mechanism

IEEE Communications Magazine

A hybrid fault-tolerant algorithm for MPLS networks

WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The major concept of the Multi-Protocol Label Switching (MPLS) network uses the Label Switch Path (LSP) technique that provides high performance in packet delivery without routing table lookup. Nevertheless, it needs more overhead to rebuild a new path when occurring link failure in the MPLS network. In this paper, we propose an efficient fast path recovery mechanism, which employs the Diffusing Update Algorithm (DUAL) to establish the working and backup paths concurrently and modify the Label Distribution Protocol (LDP) to establish the LSP by using Enhanced Interior Gateway Routing Protocol (EIGRP). Simulation results show that the proposed mechanism not only improves resource utilization but provides shorter path recovery time than the end-to-end recovery mechanism.