using the 5 router topology, list r1-r5's neighbors, and for each router list the link state of each link on the route.

Link-State Operation 1.0.0/16 10.11.0.0/16 10.5.0.0/16 I 10.3.0.0/10 R5 10.6.0.0/16 10.7.0.0/16 10.2.0.0/16 10.4.0.0/16 10.1.0.0/16 T0.10.0.0/16 R4's neighbors R1 10.3.0.0/16 10.7.0. 10.4.0.0/16 R3 R5 10.8.0.0/16 If a neighbor is present, the OSPF-enabled router attempts to establish a neighbor adjacency with that neighbor Ri's neighbors R2 R3 R4 Question 2. using the 5 router topology, list R1-R5's neighbors, and for each router, list the links state of each link on the route. LD 0:03 / 12:23 Link-State Operation (cont.) Routere Exchange LSAs 10.5.0.0/16 20 10.2.0.0/16 R2 10 10.9.0.0/16 10.11.0.0/16 10.1.0.0/16 LSAS contain the state and cost of each directly connected link. Routers flood their LSAs to adjacent neighbors. Adjacent neighbors receiving the LSA immediately flood the LSA to other directly connected neighbors, until all routers in the area have all LSAS. 10.3.0.0/16 RT 10 10.4.0.0/16 10 GAAN AA16 10.8.0.0 LSAS 21 Link-State Operation (cont.) R1 Creates the SPF Tree 10.5.0.0/16 E RON10 10.2.0.0/16 Build the topology table based on the received LSAS. This database eventually holds all the information about the topology of the network. Execute the SPF Algorithm. 10.9.0.0/16 10.11.0.0/16 10.10.0/16 10.3.0.0/16 10.6.0.0/16 10.7.0.0/16 Topology Table 10.4.0.0/16 10 (LSDB) 10.10.0.0/16 R1 will have LSUs from R2 10.8.0.0/16 R3 R4 R5 This is Topology, R1 sees Everyone now aa 22 Link-State Operation (cont.) Content of the R1 SPF Tree 10.5.0.0/16 20 10 10.2.0.0/16 10.9.0.0/16 10.11.0.0/16 10.1.0.0/16 31.6.0.9118 10.3.0.0/16 10 10.4.0.0/16 10.7.0.0/16 10 10.10.0.0/16 20 10.8.0.0/16 From the SPF tree, the best paths are inserted into the routing table. Destination Shortest Path Cost 10.5.0.0/16 10.6.0.0/16 10.7.0.0/16 10.8.0.0/16 10.9.0.0/16 10.10.0.0/16 10.11.0.0/16 R1 R2 R1 R3 R1 R3 R1 R3 R4 R1 R2 R1 R3 R4 R1 R3 R4 R5 22 7 15 17 30 25 27 23