Read without ads and support Scribd by becoming a Scribd Premium Reader.
See Premium Plans
 
Network Working Group Y. OhbaRequest for Comments: 3063 Y. KatsubeCategory: Experimental ToshibaE. RosenCisco SystemsP. DoolanEnnovate NetworksFebruary 2001MPLS Loop Prevention MechanismStatus of this MemoThis memo defines an Experimental Protocol for the Internetcommunity. It does not specify an Internet standard of any kind.Discussion and suggestions for improvement are requested.Distribution of this memo is unlimited.Copyright NoticeCopyright (C) The Internet Society (2001). All Rights Reserved.AbstractThis paper presents a simple mechanism, based on "threads", which canbe used to prevent Multiprotocol Label Switching (MPLS) from settingup label switched path (LSPs) which have loops. The mechanism iscompatible with, but does not require, VC merge. The mechanism canbe used with either the ordered downstream-on-demand allocation orordered downstream allocation. The amount of information that mustbe passed in a protocol message is tightly bounded (i.e., no path-vector is used). When a node needs to change its next hop, adistributed procedure is executed, but only nodes which aredownstream of the change are involved.Ohba, et al. Experimental [Page 1]
 
RFC 3063 MPLS Loop Prevention Mechanism February 2001Table of Contents1 Introduction .......................................... 22 Basic definitions ..................................... 33 Thread basics ......................................... 53.1 Thread attributes ..................................... 53.2 Thread loop ........................................... 73.3 Primitive thread actions .............................. 73.4 Examples of primitive thread actions ................. 104 Thread algorithm ...................................... 145 Applicability of the algorithm ........................ 145.1 LSP Loop prevention/detection ......................... 155.2 Using old path while looping on new path .............. 155.3 How to deal with ordered downstream allocation ........ 155.4 How to realize load splitting ......................... 156 Why this works ........................................ 166.1 Why a thread with unknown hop count is extended ....... 166.2 Why a rewound thread cannot contain a loop ............ 176.2.1 Case1: LSP with known link hop counts ................. 176.2.1 Case2: LSP with unknown link hop counts ............... 176.3 Why L3 loop is detected ............................... 176.4 Why L3 loop is not mis-detected ....................... 176.5 How a stalled thread automatically recovers from loop . 186.6 Why different colored threads do not chase each other . 187 Loop prevention examples .............................. 197.1 First example ......................................... 197.2 Second example ........................................ 238 Thread control block .................................. 248.1 Finite state machine .................................. 259 Comparison with path-vector/diffusion method .......... 2810 Security Considerations ............................... 2911 Intellectual Property Considerations .................. 2912 Acknowledgments ....................................... 2913 Authors' Addresses .................................... 3014 References ............................................ 30Appendix A Further discussion of the algorithm ............. 31Full Copyright Statement ..................................... 441. IntroductionThis paper presents a simple mechanism, based on "threads", which canbe used to prevent MPLS from setting up label switched paths (LSPs)which have loops.When an LSR finds that it has a new next hop for a particular FEC(Forwarding Equivalence Class) [1], it creates a thread and extendsit downstream. Each such thread is assigned a unique "color", suchthat no two threads in the network can have the same color.Ohba, et al. Experimental [Page 2]
Search
Search History:
Searching...
Result 00 of 00
00 results for result for
  • p.
    • Notes
    Load more