Topic

Distance Vector

3 questions in this topic.

2013 Q3(b)Network Layer / IPDistance Vector· 8 marks

Figure 1 is a diagrammatical depiction of a network of routers with link costs. Copy the table given in the figure and complete the distance table using the Distance Vector routing algorithm executed at node B. Assume that routing loops are prevented. Finally indicate in a table the resulting routing table.

Bellman-Fordrouting table

Open question →

2015 Q3(b)(i)Network Layer / IPDistance Vector· 3 marks

Node A is using distance vector routing. The current distance table and routing table at Node A are shown below. Current distance table at Node A (rows: to; columns: via B C D E) to B: via B = 2 to C: via C = 1 to D: – to E: via E = 8 Current routing table at Node A dest | next hop | cost B | B | 2 C | C | 1 E | E | 8 Node A receives the following vector from neighbour Node B [A, 2 C, 2 D, 2 E, 5] Show the updated distance table at A after it processes this vector.

Bellman-Forddistance table

Open question →

2015 Q3(b)(ii)Network Layer / IPDistance Vector· 2 marks

Node A is using distance vector routing. The current distance table and routing table at Node A are shown below. Current distance table at Node A (rows: to; columns: via B C D E) to B: via B = 2 to C: via C = 1 to D: – to E: via E = 8 Current routing table at Node A dest | next hop | cost B | B | 2 C | C | 1 E | E | 8 What vector, if any, will be sent by A after its distance table has been updated?

Bellman-Fordadvertisement

Open question →