The MPLS WG Archive

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



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

[IP-Optical] An algorithm for calculating all paths between an s-d pair

  • From: "John Strand" <jls@photonics.eecs.berkeley.edu>
  • Date: Tue, 14 Aug 2001 13:38:00 -0700
  • Importance: Normal

I think you need to define your problem better. I assume you dont want
loops,
for example. For most apps there are lots of paths that dont make any
sense - for example hopping repeatedly from one side of the network to the
other. Also, unless you are working in quite a small network a complete
path list will be HUGE.

John

-----Original Message-----
From: ip-optical-admin@lists.bell-labs.com
[mailto:ip-optical-admin@lists.bell-labs.com]On Behalf Of Pin-Han Ho
Sent: Tuesday, August 14, 2001 12:51 PM
To: Chrysostomos Tziouvaras; mpls-ops@mplsrc.com; mpls@UU.NET;
IP-Optical@lists.bell-labs.com
Subject: Re: [IP-Optical] An algorithm for calculating all paths between
an s-d pair


What kind of paths do you need? Shortest ones?
----- Original Message -----
From: "Chrysostomos Tziouvaras" <tziou@ics.forth.gr>
To: <mpls-ops@mplsrc.com>; <mpls@UU.NET>; <IP-Optical@lists.bell-labs.com>
Sent: Tuesday, August 14, 2001 2:58 AM
Subject: [IP-Optical] An algorithm for calculating all paths between an s-d
pair


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





_______________________________________________
IP-Optical mailing list
IP-Optical@lists.bell-labs.com
http://lists.bell-labs.com/mailman/listinfo/ip-optical