The MPLS WG Archive

Cell Relay Retreat>MPLS WG Archive>month:2001-Jan> msg00013



[Date Prev][Date Next][Thread Prev][Thread Next]  
  [Date Index][Thread Index][Author Index][Subject Index]

ERO and strict/loose subobject

  • From: "Sanford, Bill" <bills@netplane.com>
  • Date: Wed, 3 Jan 2001 10:31:03 -0500
  • Cc: "'mpls@uu.net'" <mpls@UU.NET>

> -----Original Message-----
> From: Yangguang Xu [mailto:xuyg@lucent.com]
> Sent: Tuesday, January 02, 2001 4:56 PM
> To: Sanford, Bill
> Subject: Re: ERO and strict/loose subobject
> 
> Bill,
> 
> The "L" bit for a node doesn't mean the node is loose. 

That is exactly what it means.

> Indeed, the node is
> strict but the path from preceding node to this node is 
> loose. Am I right?
> 
> Thanks,
> 
> Yangguang
> 

Yangguang, in draft-ietf-mpls-rsvp-lsp-tunnel-07.txt:

4.3.3.1. Strict and Loose Subobjects

   The L bit in the subobject is a one-bit attribute.  If the L bit is
   set, then the value of the attribute is 'loose.'  Otherwise, the
   value of the attribute is 'strict.'  For brevity, we say that if the
   value of the subobject attribute is 'loose' then it is a 'loose
   subobject.'  Otherwise, it's a 'strict subobject.'  Further, we say
   that the abstract node of a strict or loose subobject is a strict or
   a loose node, respectively.  Loose and strict nodes are always
   interpreted relative to their prior abstract nodes.

If you have a "loose prior abstract node," the address *may* be the previous
hop in the ERO list.  If you have a "strict prior abstract node," the
address *must* be the previous hop in the ERO list.

Bill