nanog
mailing list archives
Re: Dijkstra Simulator
From: "Daniel O. Awduche" <awduche () uu net>
Date: Sun, 05 Apr 1998 22:49:18 0400
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 FloydWarshall 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:
Could someone provide a reference for a Dijkstra simulator?
Ideally this would take three sets of inputs (links, nodes,
metrics) and produce edgepair traffic flows.
Any suggestions appreciated, especially for GPL stuff that has
code.
a
By Date
By Thread
Current thread:
 Dijkstra Simulator Alan Hannan (Apr 03)
 <Possible followups>
 Re: Dijkstra Simulator Daniel O. Awduche (Apr 06)
