The MPLS WG Archive

Cell Relay Retreat>MPLS WG Archive>month:2001-Aug> msg00091



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

An algorithm for calculating all paths between an s-d pair

  • From: Ramesh Bhandari <bhandari1@lucent.com>
  • Date: Tue, 14 Aug 2001 13:36:30 -0400
  • CC: mpls-ops@mplsrc.com, mpls@UU.NET, IP-Optical@lists.bell-labs.com

Hi Chrysostomos,

I believe you are searching for the K-shortest path algorithm, which
provides paths for a given pair of nodes in ascending order of their
lengths. An example website for information on this is
http://www.mat.uc.pt/~eqvm/cientificos/investigacao/r_papers.html#mps.

But, if you are looking for algorithms for K-disjoint paths, these can
be found in my book: "Survivable Networks: Algorithms for Diverse
Routing", Kluwer Academic Publishers (1999).

Regards,

Ramesh

Chrysostomos Tziouvaras wrote:
> 
> Hi,
> I am searching for an algorithm for calculating all paths between an s-d
> pair. Can you provide me pointers to books or URLs?
> 
> Thanks
> Chrysostomos