Consider the diagram below, use Dijkstra’s link-state routing algorithm compute the least cost path from X to all other nodes and show the resulting forwarding table in x......
IT 213A ASSIGMENT
Due date 04/10/2024.
Consider the diagram below, use Dijkstra’s link-state routing algorithm compute the least cost path from X to all other nodes and show the resulting forwarding table in x (5 points)
| Step | N` | D(u), p(u) | D(v), p(v) | D(w), p(w) | D(y), p(y) | D(z), p(z) |
| u | v | w | y | z | ||
| 0 | 1, x | 2, x | 3, x | 1, x | ∞ | |
| 1 | ||||||
| 2 | ||||||
| 3 | ||||||
| 4 | ||||||
| 5 |
