Question

Consider the network of Fig. 5-7, but ignore the weights on the lines. Suppose that it uses flooding as the routing algorithm. If a packet sent by A to D has a maximum hop count of 3, list all the routes it will take. Also tell how many hops worth of bandwidth it consumes.

Consider the network of Fig. 5-7, but ignore the weights on the lines. Suppose that it uses flooding as the routing algorithm. If a packet sent by A to D has a maximum hop count of 3, list all the routes it will take. Also tell how many hops worth of bandwidth it consumes. B 7 с N 3 2 3 E N AC תס N OD 2 6 4 4 CH G Fig. 5-7

Answer 1

B 7 с. 2 3 2 3 E 2 F 2 D 2 6 4 H С G Ab In this network a packet sent by A to D has a maximum hop count of 3, it will take following routes: (1) ABCD i) ABCF (iii) ABER (iv) ABEG (v) ACHD vi) ACHF (vii) AEB (vii) ACER So, there are total routes = 8 and hop count = 3 then, total number of hops used = 8X3 = 24