The WANDL network planning and analysis software can be used
for this purpose (and much more).
Alternatively, you can trivially write an all "pairs shortest
path" program, using, for example, the Floyd-Warshall dynamic
programming algorithm (See "Introduction to Algorithms," by
Corman, Leiserson, and Rivest). The same result can be gotten
by running Dijkstra's algorithm |V| times (once for each node),
where |V| is the cardinality of the set of nodes in your network
graph.
/Dan.
Alan Hannan said:
The WANDL network planning and analysis software can be used
for this purpose (and much more).
Alternatively, you can trivially write an all "pairs shortest
path" program, using, for example, the Floyd-Warshall dynamic
programming algorithm (See "Introduction to Algorithms," by
Corman, Leiserson, and Rivest). The same result can be gotten
by running Dijkstra's algorithm |V| times (once for each node),
where |V| is the cardinality of the set of nodes in your network
graph.
and ospf spec gives a step by step description - took me about 100 lines of
perl code in 90 minutes to get it working.
sorry for this blast from the past.
Jim
p.s. - how is that ip navigator treating you - is there any other than the
big C? (oops -that's little c, isn't it?).
p.s. - how is that ip navigator treating you - is there any other than the
big C? (oops -that's little c, isn't it?).
frontier globalcenter is not planning to use ip navigator in the
core of our network today.
we are moving away from ip/atm and towards ip/sonet&ip/wdm. We
have 1 oc12 using packet over sonet up today, and several oc3s; phased
deployment of oc12 and oc48 starting 3Q98 and completed in 1Q99.
we are exploring using ip navigator in our l2 aggregation frame
and atm networks.
big C/A,J,T,L,N little c they all have reasonable products, just
some are more reasonable than others.
what really burns me is when a company we are working with under
nda tells our competition what we are exploring, and when they
publish press releases about their customers without that
customers approval.
-alan