Question

Distance vector routing

In the illustrated network, routes are determined using the distance vector algorithm . The marked router v has been newly added, it only knows the direct costs to its neighbor routers u , y and z .

(a) Specify the distance vectors in all routers except v before adding v . We assume that the distance vector algorithm for all routers existing at this time is already terminated.

(b) Give the initial distance vector in the router v .

(c) Indicate how the distance vectors of all neighbors of v change when they receive the initial distance vector of v . Select the entries that change.

(d) Give the final distance vectors in all routers after re-scheduling the distance vector algorithm.

Here IS the photo:

4 V 7 12 Z 10 2 y 1 X

Answer 1

X 1 Can Cost nent nent Cost TO 12 13 Z Z To Cost nank Cost nent To 3 13 3

Tnita dintenca vecton in gout, v to Cost nent V 4 3

chany teble No To Cost neut bacaux O doesn eeeive derutly tab e d V 24 chagt vk-thanged tao le Ztab nent to Coat To cOst nent V V 1 3 Chaz changed 2. 1 N

Finas dintances (d) Roututabk To nent table Rouln V to Cost nat C 3 V 3 v tabe Routa V 2 neit Cot TO V 5 Roiuth cost nert Rout 1 nent Cost To o 3 Z. N JnNJ N E < o