The MPLS WG Archive

["Dmitri Krioukov" <dima@krioukov.net>]

My understanding is that the TE path computation draft
is now expired, but the old version is still available
from
http://www.watersprings.org/links/mlr/id/draft-kompella-te-pathcomp-00.txt,
for example.
--
dima.

> -----Original Message-----
> From: owner-mpls@UU.NET [mailto:owner-mpls@UU.NET]On Behalf Of wushao
> wen
> Sent: Friday, April 20, 2001 12:59 PM
> To: mpls@UU.NET
> Subject: Constraint-based Shortest path algorithm
>
>
> 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