mmmm

The network diagram below displays the connectivity of a single Autonomous System. Cost 1 2 2 R7 Network Any LAN 10.10.X.0 20.20.1.0 20.20.2.0 20.20.3.0 X stands for 1,2 or 3 R8 5 5 LANF LAN A 20.20.2.0 RO 10.10.1.0 20.20.1.0 R4 R5 LAN C 10.10.2.0 LAN B LAN D R2 10.10.3.0 R1 20.20.3.0 R3 1 LAN E 11. Suppose that while a Link-State routing protocol (such as OSPF) is running, router R3 only received link-state packets from routers R2 and R7. Draw the shortest paths tree rooted at R3 that this router would build. (1 mark) The network diagram below displays the connectivity of a single Autonomous System. Cost 1 2 2 R7 Network Any LAN 10.10.X.0 20.20.1.0 20.20.2.0 20.20.3.0 X stands for 1,2 or 3 R8 5 5 LANF LAN A 20.20.2.0 RO 10.10.1.0 20.20.1.0 R4 R5 LAN C 10.10.2.0 LAN B LAN D R2 10.10.3.0 R1 20.20.3.0 R3 1 LAN E 11. Suppose that while a Link-State routing protocol (such as OSPF) is running, router R3 only received link-state packets from routers R2 and R7. Draw the shortest paths tree rooted at R3 that this router would build. (1 mark)