The MPLS WG Archive

Cell Relay Retreat>MPLS WG Archive>month:2002-Jan> msg00113



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

Explicit Loose Path Computation

  • From: sven.van_den_bosch@alcatel.be
  • Date: Thu, 17 Jan 2002 08:55:00 +0100
  • Cc: "LE ROUX Jean-Louis FTRD/DAC/LAN" <jeanlouis.leroux@rd.francetelecom.com>, "Charlap, David" <David.Charlap@Marconi.com>, "'Snigdho Bardalai'" <sbardalai@yahoo.com>, mpls@UU.NET
  • X-MIMETrack: Serialize by Router on BEMAIL04/BE/ALCATEL(Release 5.0.8 |June 18, 2001) at01/17/2002 08:55:31

Ben,

Thanks for your comment. Would you care to expand on this a little bit?

>>I also believe that CSPF is a more efficient way to compute an ERO that
is
>>constraint
>>than by using a complex signalling mechanism and finding the ERO
Constraint
>>path.

What do you propose to do:
a. use CSPF per area and rely on reachability info to select intermediate
hops
b. use CSPF per area but explicitly specify some hops (maybe the ABRs in
the case of interarea TE). In this case how do you know which ones to
specify?
c. use CSPF and signal "remote" path segments to the computing node that
assembles them to the complete path. This would also require some sort of
(possibly complex) signalling

Sven.