> < CPIT 600 Q2) CPIT600-Assignment1-Fall 2020-Q(1) Assignment1 : 10/10/2020 H1 R1 H2 R2 H3 R3...

Transcribed Image Text:

> < CPIT 600 Q2) CPIT600-Assignment1-Fall 2020-Q(1) Assignment1 : 10/10/2020 H1 R1 H2 R2 H3 R3 H4 Net 1 Net 2 Net 3 Net 4 H5 H6 H7 R4 R5 Net 5 Net 6 Net 7 O O O A corporation has seven networks connected by five routers as shown in the above figure. All five routers use the distance-vector RIP algorithm. The routing table in each router has three fields: a destination network IP address, the distance (cost) to reach this destination and the next hop. Assume the following: i) RIP uses Split Horizon with Poisoned Reverse, ii) the cost to reach a host in a network directly connected to a router is 1 hop and iii) if a router discovers multiple routes to the same destination with the same cost, it selects the route whose next hop is the router with the highest Id. a) Give the shortest path information sent by router R4 to the two neighboring routers R3 and R5 shortly after convergence of all routing tables is achieved. b) Router R2 completely failed. Indicate the sequence of changes in the contents of the entry whose destination address is "Net 2 in the routing table of each of the four routers R1, R3, R4 and R5. Assume all routers execute two synchronized steps to update their routing tables. In the first step, each router sends its current shortest path information to its neighbors and in the second step, each router updates its routing table based on the new measurements of link costs and on the new shortest path information received from its neighbors. BOTA 2/3 > T T H{ T > < CPIT 600 Q2) CPIT600-Assignment1-Fall 2020-Q(1) Assignment1 : 10/10/2020 H1 R1 H2 R2 H3 R3 H4 Net 1 Net 2 Net 3 Net 4 H5 H6 H7 R4 R5 Net 5 Net 6 Net 7 O O O A corporation has seven networks connected by five routers as shown in the above figure. All five routers use the distance-vector RIP algorithm. The routing table in each router has three fields: a destination network IP address, the distance (cost) to reach this destination and the next hop. Assume the following: i) RIP uses Split Horizon with Poisoned Reverse, ii) the cost to reach a host in a network directly connected to a router is 1 hop and iii) if a router discovers multiple routes to the same destination with the same cost, it selects the route whose next hop is the router with the highest Id. a) Give the shortest path information sent by router R4 to the two neighboring routers R3 and R5 shortly after convergence of all routing tables is achieved. b) Router R2 completely failed. Indicate the sequence of changes in the contents of the entry whose destination address is "Net 2 in the routing table of each of the four routers R1, R3, R4 and R5. Assume all routers execute two synchronized steps to update their routing tables. In the first step, each router sends its current shortest path information to its neighbors and in the second step, each router updates its routing table based on the new measurements of link costs and on the new shortest path information received from its neighbors. BOTA 2/3 > T T H{ T