MPLS Loop Prevention Mechanism

Document Type Expired Internet-Draft (individual)
Authors Yasuhiro Katsube  , Yoshihiro Ohba  , Eric Rosen  , Paul Doolan 
Last updated 1998-11-19 (latest revision 1998-07-31)
Stream (None)
Expired & archived
plain text pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


This paper presents a simple mechanism, based on 'threads', which can be used to prevent MPLS from setting up label switched path (LSPs) which have loops. The mechanism is compatible with, but does not require, VC merge. The mechanism can be used with either the ordered downstream-on-demand allocation or ordered downstream allocation. The amount of information that must be passed in a protocol message is tightly bounded (i.e., no path-vector is used). When a node needs to change its next hop, a distributed procedure is executed, but only nodes which are downstream of the change are involved.


Yasuhiro Katsube (
Yoshihiro Ohba (
Eric Rosen (
Paul Doolan (

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)