Chapter $2-$ Part $2$: Link State Routing

I. Link state routing

Consider the following network. The objective is to fill the routing and forwarding tables of node X$.$

Q$1.$ Draw the shortest$-$path tree from X

Use the Dijkstra$$s algorithm to compute the shortest path from X to all the other routers, then draw the shortest path tree.