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. c. Tabulate a Distance Vector Routing Table with the following headings; Destination, Route, Least Cost and Next Hop using the table below. Destination Customer 1 Customer 2 Customer 3 Customer 4 Customer 5 Customer 7 Customer 8 Customer 9 Customer 10 Route Least Cost Next Hop
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
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.
c. Tabulate a Distance
Destination
Customer 1 Customer 2 Customer 3 Customer 4 Customer 5 Customer 7 Customer 8 Customer 9 Customer 10
Route
Least Cost
Next Hop
–...3/3
![l GH Vodafone 3G
9:28 AM
@ 75%
Done CICS-202_DataComll -BIT May20...
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.
R5
R8
R6
R1
R9
R10
R4
R7
8
a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.
Iteration
Nodes
R1 R2 R3 R4 R5 R7 R8 R9 R10
[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]|
1
2
3
4
5
6.
7
8.
9.
...2/3
!!](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fab77765c-57a4-4435-a796-e0a184515098%2F3b8b23e8-bfa6-471f-af8a-edf901f0cec6%2Fmcdzzx_processed.png&w=3840&q=75)
![l GH Vodafone 3G
9:28 AM
@ 74%
Done CICS-202_DataComll -BIT May20...
-...2/3
b. Build/Sketch the new Dijkstra Shortest Path Tree.
c. 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
-...3/3](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fab77765c-57a4-4435-a796-e0a184515098%2F3b8b23e8-bfa6-471f-af8a-edf901f0cec6%2Fd4kftt_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)