A fast path recovery mechanism for MPLS networks

Jenhui Chen; Chung Ching Chiou; Shih Lin Wu

doi:10.1007/978-3-540-31957-3_8

A fast path recovery mechanism for MPLS networks

Jenhui Chen^*, Chung Ching Chiou, Shih Lin Wu

^*Corresponding author for this work

BroadWeb Inc.

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	58-65
Number of pages	8
Journal	Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume	3421
Issue number	II
DOIs	https://doi.org/10.1007/978-3-540-31957-3_8
State	Published - 2005
Event	Networking - ICN 2005 - Reunion Island, France Duration: 17 04 2005 → 21 04 2005

Keywords

Algorithms
Diffusing Update Algorithm (DUAL)
Label Distribution Protocol (LDP)
Multi-Protocol Label Switching (MPLS)
Network protocols
Resource allocation
Shorter path recovery time

Access to Document

10.1007/978-3-540-31957-3_8

Cite this

@article{49c3834a93584f17a14975854dc27c0d,

title = "A fast path recovery mechanism for MPLS networks",

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.",

keywords = "Algorithms, Diffusing Update Algorithm (DUAL), Label Distribution Protocol (LDP), Multi-Protocol Label Switching (MPLS), Network protocols, Resource allocation, Shorter path recovery time",

author = "Jenhui Chen and Chiou, {Chung Ching} and Wu, {Shih Lin}",

year = "2005",

doi = "10.1007/978-3-540-31957-3_8",

language = "英语",

volume = "3421",

pages = "58--65",

journal = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

number = "II",

note = "Networking - ICN 2005 ; Conference date: 17-04-2005 Through 21-04-2005",

}

TY - JOUR

T1 - A fast path recovery mechanism for MPLS networks

AU - Chen, Jenhui

AU - Chiou, Chung Ching

AU - Wu, Shih Lin

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Algorithms

KW - Diffusing Update Algorithm (DUAL)

KW - Label Distribution Protocol (LDP)

KW - Multi-Protocol Label Switching (MPLS)

KW - Network protocols

KW - Resource allocation

KW - Shorter path recovery time

UR - http://www.scopus.com/inward/record.url?scp=26844576785&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-31957-3_8

DO - 10.1007/978-3-540-31957-3_8

M3 - 会议文章

AN - SCOPUS:26844576785

SN - 0302-9743

VL - 3421

SP - 58

EP - 65

JO - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

JF - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

IS - II

T2 - Networking - ICN 2005

Y2 - 17 April 2005 through 21 April 2005

ER -

A fast path recovery mechanism for MPLS networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this