Problem 1. In the network of Figure 19.1 (p.593), the current routing table of N

Question

Problem 1. In the network of Figure 19.1 (p.593), the current routing table of N1 is given in (a) below. Assume N1's neighbors N2, N3, and N4 learn of the network cost change before N1. Each of these neighbors update its delay vector in D2, D3, and D4, and sends a copy to all of its neighbors, including N1. With these updated D vectors being received, your job is to apply the Distance-Vector routing approach to help N1 to generate a new routing table by filling all 10 yellow boxes in (c) so N1 can use it to replace the old one in (a). (3 points each box, 30 points in total) Desti Next Desti Next nationDelaynode nationDelay node 4 0 0 0 0 0 4 1.2 S1 D4 (a) Node l's Routing table before update (b) Delay vectors sent to node 1 (c) Node l's routing table after update and link costs used in update from neighbor nodes Figure 19.5 Original ARPANET Routing Algorithm

Explanation / Answer

Hi,

Below is the answer-

Destination Delay Next Node 1 0 - 2 2 2 3 3 2 4 1 4 5 5 4 6 5 2

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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