(Storing the previous and successive nodes assists in detecting loops and avoiding the counting-to-infinity problem – a shortcoming of Distance Vector Routing.)
(Storing information about the preceding and following nodes enables the identification of cycles and avoids the problem of unbounded counting – a limitation of Distance Vector Routing.)