Telematics Chapter 6: Network Layer - Freie Universität Berlin

Distance Vector Routing: Count to Infinity
● Count to Infinity problem:
● The Distance Vector Routing achieves a correct solution, but possibly many (up
to infinite) update steps are necessary.
● Example:
● Five routers A, B, C, D, and E are connected in a linear fashion, the distance
between neighbor routers in each case is 1.
A B C D E
1 1 1
1
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
6.183