MPLS Loop Prevention Mechanism | Zendy

Yoshihiro Ohba | Zendy; Yasuhiro Katsube | Zendy; Eric Rosen | Zendy; Paul Doolan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

MPLS Loop Prevention Mechanism

Author(s) -

Yoshihiro Ohba,

Yasuhiro Katsube,

Eric Rosen,

Paul Doolan

Publication year - 2001

Publication title -

rfc

Language(s) - English

Resource type - Reports

DOI - 10.17487/rfc3063

Subject(s) - multiprotocol label switching , merge (version control) , computer science , downstream (manufacturing) , computer network , path (computing) , mechanism (biology) , label switching , distributed computing , label distribution protocol , quality of service , engineering , parallel computing , philosophy , operations management , epistemology

This paper presents a simple mechanism, based on "threads", which can be used to prevent Multiprotocol Label Switching (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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research