Answer to Question #248597 in Computer Networks for Kikri

Question

Section B (Design Works)

 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.

  Iteration

0 1 2 3 4 5 6 7 8 9

Nodes

[6]

[6,3]

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

R1 R2 R3 R4 R5 R7 R8 R9 R10

                 –...2/3

b. Build/Sketch the new Dijkstra Shortest Path Tree.

Answer 1

a.

b.