Assignment 3 PDF
Assignment 3 PDF
1.
The tables represent the routing table of Router A, B and D at a single point of time. Router D
receives updates from A and B routers. All routers are running Distance Vector algorithm. How
will Router D calculate the best paths to all destinations after receiving the updates from A and B
only? Show the updated table. (Use Dx(y) = min{c(x,y) + Dy(y), c(x,z) + Dz(y)} for explaining your
answer)
2. Link state routing protocol uses Dijkstra’s algorithm. Now refer to figure below, using Dijkstra’s
algorithm, compute the shortest path from Y to all other remote networks.
3. “Unlike RIPv2, a distance vector protocol, link state does not need to mark any interface as
passive-interface”. Justify this statement