0.3 (20) In the following diagram, A, B, C, and D are the gateways (routers), an

Question

0.3 (20) In the following diagram, A, B, C, and D are the gateways (routers), and lines are the links. We are only interested in routes (from each gateway) to the "target network" 12 Target 1 Network simple distance vector routing algorithm has been implemented at every router, and the routing information at all routers with respect to the "target network" is given in the Table 1. Table 1 Router Entry for "target network directly connected, metric l route via D, metric 2 route via B, metric 4 route via B, metric 5 Assume that all nodes exchange their routing information to their immediate neighbors at the same time after one second. Suppose that the link B-D fails. At time-0, the routing tables at each node has the following information with respect to the "target network" Table 2 Router t-0 direct, I B, 4 B, 5 (a) What are the entries of routing tables (Table 2) at time -1,2.... till the system converges?

Explanation / Answer

As said in the question that the links fails and routers update their table in every one second

so lets assume that at t=0 the link fails.....just after the routing table is updated....

the new table would be

at first all the record will be discarded as the link fails and again at t=2 second the router again synchronise and find the new router and update the table as above

routers t=1 t=2 D direct, 1 direct, 1 B - c,, 14 C - D, 13 A - C,17

Related Questions

Navigate

• Browse (All)
• Browse
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.