Routing Algorithms

• Model the network as a graph

• Associate costs with the edges

• For all pairs (j, k), attempt to identify the shortest path / route from j to k.

• Classical algorithms: Dijkstra’s, Bellman-Ford

Previous slide

Next slide

Back to first slide

View graphic version