1. 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) i. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7] 7 [6,3,2,1,4,5,7,8] 8 [6,3,2,1,4,5,7,8,9] 9 [6,3,2,1,4,5,7,8,9,10] ii. Build/Sketch the new Dijkstra Shortest Path Tree. iii. Tabulate a Distance Vector Routing Table with the following headings; Destination, Route, Least Cost and Next Hop using the table below. Destination Route Least Cost Next Hop Customer 1 Customer 2 Customer 3 Customer 4 Customer 5 Customer 7 Customer 8 Customer 9 Customer 10
1. Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra
(a) i. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.
|
Iteration |
Nodes |
R1 |
R2 |
R3 |
R4 |
R5 |
R7 |
R8 |
R9 |
R10 |
|
0 |
[6] |
|
|
|
|
|
|
|
|
|
|
1 |
[6,3] |
|
|
|
|
|
|
|
|
|
|
2 |
[6,3,2] |
|
|
|
|
|
|
|
|
|
|
3 |
[6,3,2,1] |
|
|
|
|
|
|
|
|
|
|
4 |
[6,3,2,1,4] |
|
|
|
|
|
|
|
|
|
|
5 |
[6,3,2,1,4,5] |
|
|
|
|
|
|
|
|
|
|
6 |
[6,3,2,1,4,5,7] |
|
|
|
|
|
|
|
|
|
|
7 |
[6,3,2,1,4,5,7,8] |
|
|
|
|
|
|
|
|
|
|
8 |
[6,3,2,1,4,5,7,8,9] |
|
|
|
|
|
|
|
|
|
|
9 |
[6,3,2,1,4,5,7,8,9,10] |
|
|
|
|
|
|
|
|
|
ii. Build/Sketch the new Dijkstra Shortest Path Tree.
iii. Tabulate a Distance
|
Destination |
Route |
Least Cost |
Next Hop |
|
Customer 1 |
|
|
|
|
Customer 2 |
|
|
|
|
Customer 3 |
|
|
|
|
Customer 4 |
|
|
|
|
Customer 5 |
|
|
|
|
Customer 7 |
|
|
|
|
Customer 8 |
|
|
|
|
Customer 9 |
|
|
|
|
Customer 10 |
|
|
|
Step by step
Solved in 3 steps with 3 images
