Question

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.

a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below

Answer 1

The answer to your question is provided below