The MPLS WG Archive

Cell Relay Retreat>MPLS WG Archive>month:2001-Apr> msg00380



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

Constraint-based Shortest path algorithm

  • From: wushao wen <wswen@ece.ucdavis.edu>
  • Date: Fri, 20 Apr 2001 09:58:46 -0700
  • X-Apparently-From: Wswen99@aol.com

Hello,
        In the traffic engineering, we need to calculate the 
constraint-based shortest path for a FEC. Is there any mature and efficient 
algorithm to do the calculation? Let's said that we have two parameter for 
each link (cost, and delay), how can we calculate the shortest path under 
end-to-end delay constraint (As I know, this is NP hard problem, right)?
       If anybody have implemented some  algorithms on this, please let me 
know.
       Thanks!


Wushao