Teaching on Testbeds

Dijkstra's algorithm

Fraida Fund

Runs on: Networking, FABRIC, CloudLab

In this experiment, we will use Dijkstra’s algorithm to find the shortest path from one node in a six-node topology, to all other nodes. We will then install routing rules at each node to implement the shortest-path tree produced by Dijkstra’s algorithm.

It should take about 120 minutes to run this experiment.

You can run this experiment on FABRIC or CloudLab.

Dijkstra’s shortest path algorithm

This material is based upon work supported by the National Science Foundation under Grant No. 2231984.

Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.