Avoiding Loops in MPLS

Document Type Expired Internet-Draft (individual)
Authors Yoshihiro Ohba  , Loa Andersson  , Cheng-Yin Lee 
Last updated 1999-11-11
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized (tools) 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 document proposes a general method to avoid loops while setting up Label Switched Paths (LSPs), and is applicable to both unicast and multicast label setup. The approach taken is to solve the problem of constructing a tree for delivering data. The solution verifies the path towards the root of the tree is loop free before a node is grafted to the tree. This loop avoidance scheme complements loop detection in LDP.


Yoshihiro Ohba (ohba@csl.rdc.toshiba.co.jp)
Loa Andersson (loa@pi.se)
Cheng-Yin Lee (Cheng-Yin.Lee@alcatel.com)

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