0% found this document useful (0 votes)
50 views

Assignment 3 PDF

The document discusses routing tables and algorithms. It contains routing tables from routers A, B, and D. It asks how router D will calculate best paths to destinations after receiving updates from routers A and B. It also asks to compute shortest paths from router Y to other networks using Dijkstra's algorithm and justifies a difference between RIPv2 and link state routing.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
50 views

Assignment 3 PDF

The document discusses routing tables and algorithms. It contains routing tables from routers A, B, and D. It asks how router D will calculate best paths to destinations after receiving updates from routers A and B. It also asks to compute shortest paths from router Y to other networks using Dijkstra's algorithm and justifies a difference between RIPv2 and link state routing.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CSE421 Assignment 03 Marks: 10

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

You might also like