Merit Network
Can't find what you're looking for? Search the Mail Archives.
  About Merit   Services   Network   Resources & Support   Network Research   News   Events   Home

Discussion Communities: Merit Network Email List Archives

North American Network Operators Group

Date Prev | Date Next | Date Index | Thread Index | Author Index | Historical

Re: Dijkstra Simulator

  • From: Daniel O. Awduche
  • Date: Mon Apr 06 11:28:14 1998

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:
> 
>   Could someone provide a reference for a Dijkstra simulator?
> 
>   Ideally this would take three sets of inputs (links, nodes,
>   metrics) and produce edge-pair traffic flows.
> 
>   Any suggestions appreciated, especially for GPL stuff that has
>   code.
> 
>   -a




Discussion Communities


About Merit | Services | Network | Resources & Support | Network Research
News | Events | Contact | Site Map | Merit Network Home


Merit Network, Inc.