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 I. Table 1 Router Entry for "target network directly connected, metric1 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 direct, 1 B. 4 B, 5 (a) What are the entries of routing tables (Table 2) at time -1,2,... .ill the system converges?

Explanation / Answer

We are given the information that at t=0 link B-D fails. Therefore considdering all nodes exchange their routing information within 1 second, by t=1 the network routing gets modified accordingly by ignoring B-D

D - Directly connected metric 1

C - route via D metric 13

B - route via C metric 15

A - route via C metric 17

Therefore the contents of the table for t=1,2... till the system converges would be as follows:

Router t=1,2... D direct,1 B C,15 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.