Answer to Question #248573 in Computer Networks for Serwaa

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

ITERA TION NODES R2 R3 R4 R5 R7 R8 R9 R10 0

[6] 5 2 4 3 1 2 3 1 1

[6,3] 3 1 2 2 1 1 4 1 2

[6,3,2] 5 3 2 2 4 3 1 4 3

[6,3,2,1] 2 4 1 2 3 5 1 1 4

[6,3,2,1,4] 1 1 2 3 5 1 2 1 5

[6,3,2,1,4,5] 4 3 4 1 2 1 1 1 6

[6,3,2,1,4,5,7 ] 2 10 2 3 5 3 4 4 7

[6,3,2,1,4,5,7 ,8] 1 2 2 2 3 1 10 2 8

[6,3,2,1,4,5,7 ,8,9] 10 2 3 4 5 5 1 2 9

[6,3,2,1,4,5,7 ,8,9,10] 2 2 10 1 2 3 4 5