Functions of OSI and TCP/IP Layers Q.42
Consider a network with 6 routers R1 to R6 connected
with links having weights as shown in the following
diagram.
- Option : C
- Explanation : Following will be distance vectors of all nodes.
Shortest Distances from R1 to other nodes (i.e. R2, R3, R4, R5, R6) is represented by vector R1(5, 3, 12, 12, 16).
Used links are R1 – R3, R3 – R2, R2 – R4, R3 – R5, R5 – R6
Shortest Distances from R2 to other nodes (i.e. R3, R4, R5, R6) is R2(2, 7, 8, 12) used links are R2 – R3, R2 – R4, R4 – R5, R5 – R6.
Shortest Distances from R3 to other nodes (i.e. R4, R5, R6) is R3(9, 9, 13) used links are R3 – R2, R2 – R4, R3 – R5, R5 – R6
Shortest Distances from R4 to R5 and R6 is R4(1, 5) used links are R4 – R5, R5 – R6
Shortest Distance from R5 to R6 is R5(4)
Used links are R5 – R6
If we mark, all the used links one by one, we can see that following links are never used.
R1 – R2
R4 – R6
