Question: Assume that the network in Figure 20.34 (Problem P20-8) uses distance vector routing with the forwarding table as shown for each node. If node E
Assume that the network in Figure 20.34 (Problem P20-8) uses distance vector routing with the forwarding table as shown for each node. If node E is added to the network with a link of cost 1 to node D, can you find the new forwarding tables for each node without using the distance-vector algorithm?
Figure 20.34
![B D C|0 D] 6 D|0 ABCD + bo ABCD ABCD](https://dsd5zvtm8ll6.cloudfront.net/si.question.images/images/question_images/1607/4/8/9/0505fd0561ace8721607489050235.jpg)
B D C|0 D] 6 D|0 ABCD + bo ABCD ABCD
Step by Step Solution
3.44 Rating (170 Votes )
There are 3 Steps involved in it
We can guess the new routing table because the only way each node can reach ... View full answer
Get step-by-step solutions from verified subject matter experts
