Poisoned reverse is a technique used with distance vector routing algorithms to avoid the count-to-infinity problem. In essence, if a neighbour is selected as the next node from a node to a destination, then to that neighbour report an infinite distance to the destination, preventing a loop-back. It continues to maintain this “lie” as long as the node continues to route through .
It does not solve the general count-to-infinity problem — only for traps with 2 nodes. For 3 nodes, it still fails to address this.