--- 1/draft-ietf-mpls-loop-prevention-02.txt	2006-02-05 00:40:59.000000000 +0100
+++ 2/draft-ietf-mpls-loop-prevention-03.txt	2006-02-05 00:40:59.000000000 +0100
@@ -1,25 +1,26 @@
+
 Network Working Group                                     Yoshihiro Ohba
 Internet-Draft                                          Yasuhiro Katsube
-Expiration Date: April 2000                                      Toshiba
+Expiration Date: October 2000                                    Toshiba
 
                                                               Eric Rosen
                                                            Cisco Systems
 
                                                              Paul Doolan
                                                        Ennovate Networks
 
-                                                            October 1999
+                                                              April 2000
 
                      MPLS Loop Prevention Mechanism
 
-                <draft-ietf-mpls-loop-prevention-02.txt>
+                <draft-ietf-mpls-loop-prevention-03.txt>
 
 Status of this Memo
 
     This document is an Internet-Draft and is in full conformance with
     all provisions of Section 10 of RFC2026.
 
     Internet-Drafts are working documents of the Internet Engineering
     Task Force (IETF), its areas, and its working groups.  Note that
     other groups may also distribute working documents as Internet-
     Drafts.
@@ -28,23 +29,20 @@
     months and may be updated, replaced, or obsoleted by other documents
     at any time.  It is inappropriate to use Internet-Drafts as
     reference material or to cite them other than as "work in progress."
 
     The list of current Internet-Drafts can be accessed at
     http://www.ietf.org/ietf/1id-abstracts.txt
 
     The list of Internet-Draft Shadow Directories can be accessed at
     http://www.ietf.org/shadow.html.
 
-    To view the list Internet-Draft Shadow Directories, see
-    http://www.ietf.org/shadow.html.
-
 Abstract
 
     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