MPLS Loop Prevention Mechanism

Ohba, Yoshihiro; Katsube, Yasuhiro; Rosen, Eric; Doolan, Paul

doi:10.17487/rfc3063

Cited by 6 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Loop Prevention -A loop in an LSP is defined as the LSP traversing a node for more than once [12]. In subpath and link restoration techniques, since the restoration path is identified as part of the original LSP, we have to ensure that these two parts do not overlap with each other at any node.…”

Section: Identification Of the Restoration Opticalmentioning

confidence: 99%

Path vs. subpath vs. link restoration for fault management in IP-over-WDM networks: performance comparisons using GMPLS control signaling

Wang

Sahasrabuddhe²,

Mukherjee

2002

IEEE Commun. Mag.

View full text Add to dashboard Cite

We investigate three restoration techniques (path, subpath, and link restoration) for fault management in an IP-over-WDM network. We have implemented all of these techniques on the ns-2 simulation platform using GMPLS control signaling. These techniques can handle practical situations such as simultaneous multiple fiber failures, which are difficult to design for and recover from by nonrestoration techniques. We then present performance measurement results for the three restoration techniques by applying them to a typical nationwide mesh network running IP over WDM. We investigate interesting trade-offs in the performance of the restoration techniques on restoration success rate, average restoration time, availability, and blocking probability.

show abstract

Section: Identification Of the Restoration Opticalmentioning

confidence: 99%

Path vs. subpath vs. link restoration for fault management in IP-over-WDM networks: performance comparisons using GMPLS control signaling

Wang

Sahasrabuddhe²,

Mukherjee

2002

IEEE Commun. Mag.

View full text Add to dashboard Cite

show abstract

“…Loop prevention was originally set up as one of the requirements that must be fulfilled in MPLS [9]. In A-MPLS, however, we advocate to add a mechanism for the establishment of a special type of ALSPs, called circular LSPs (CLSP), which foim a ring (i.e., a loop).…”

Section: B Circular Lsps (Clsps) For Protection and Restorationmentioning

confidence: 99%

“…MPLS [l], [2], [6], [9], [lo], [ll], [12]? [13] can transform the Intemet from a connectionless network into a connection-oriented network.…”

Section: Introductionmentioning

confidence: 99%

Ad hoc MPLS for virtual-connection-oriented mobile ad hoc networks

Yeh

Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367)

View full text Add to dashboard Cite

During the past few years, IP wiih muhfprotocol lcrbel switching (MPLS) oyer Iy21M has emerged as the paradigm of choice for the future o g tical Internet. However, MPLS is complex and does not take into account the mobility in wireless networks, so the current version of MPLS cannot be a p plied to wireless networks to establish connections in an end-to-end manner. In this paper, we propose ud-hoc MPU, a tight-weight version of MPLS with the ad-hocLSPextension for the realization of end-twnd virtuabconnectionoriented ad hoc networks, which in turn enables end-twnd QoS provisioning, traffic engineering, and protectiodrestoration.

show abstract