In the three-node DV example, x has direct neighbors y (cost…
In the three-node DV example, x has direct neighbors y (cost 2) and z (cost 7). Initially y and z know only their direct costs. After receiving y’s and z’s first DVs, x computes Dx(z) using Bellman-Ford. What is Dx(z), and via which next hop?
Read Details