The MPLS WG Archive

[LE ROUX Jean-Louis FTRD/DAC/LAN <jeanlouis.leroux@rd.francetelecom.com>]

Are you sure David that there is no real need for loose nodes ?

To my mind loose routes may be relevant in case of multi-area, or multi AS
TE.

The head-end LSR calculates a route that is stirctely explicited in it's
area, because it has a complete topology, and loosely explicited in other
areas, because it has only some recheability information provided by border
routers.

Each border router receving a Path message loosely routed, determines the
strict path in it's area.


JL



-----Original Message-----
From: David Charlap [mailto:David.Charlap@marconi.com]
Sent: mercredi 16 janvier 2002 00:36
To: mpls@UU.NET
Subject: Re: Explicit Loose Path Computation


Snigdho Bardalai wrote:
> 
> I wanted to find out if anybody has come across an
> algorithm to compute an explicit loose path.

IMO, it seems rather pointless.  If you have enough routing information
available to automatically compute an ERO, why wouldn't you want to
compute a strict ERO?

IMO, loose EROs are best used only by manual-creation, where a human
operator can specify certain key nodes, knowing that the topology of the
intervening nodes may change over time.  But any software that
auto-generates these EROs should also be capable of dynamically
recomputing those EROs as the topology changes, meaning that there is no
real need for loose nodes.

At least this is my opinion.

-- David