Question

suppose the configuration of routers has the link weights shown below.

2

(a). As in the previous exercise, give each node’s forwarding table after each node exchanges with its immediate neighbors simultaneously and in parallel.

(b). How many iterations of such parallel exchanges will it take before C learns to reach F via B; that is, before it creates the entry 〈F,B,11〉? Count the answer to part (a) as the first iteration.

Answer 1

around Roats ng on (kona e ( 1stok.ro.E9on) 어 tabla, -the sic ulin eides at each hede axe At A Di stane 5%ton ve cC DIA- rろ (6 A. E 臣 6 A I ine en c honge. out

G.V.P. COLLEGE OF ENGINEERING Page No ve tnouw thal and So on enchang Ces ten9