(a) For the network shown below with the given link costs, use Dijkstra’s algorithm to determine the shortest path from A to all other nodes
(b) Based on your answer to (a), what would the forwarding table at A look like?
(c) Consider the distance-vector routing algorithm applied to this network.
(d) Show the initial distance tables for nodes A, B, F and G (i.e. when each node is only aware of its immediate neighbours). (ii) Show the distance table for node A after the first exchange of distance vectors between neighbours.
Resource created Saturday 04 September 2021, 10:47:47 AM, last modified Wednesday 27 October 2021, 02:44:56 PM.