With split horizon, when a node sends a routing update to its neighbor, it does not send those routes it learned from each neighbor back to that neighbor. In another variation of split horizon, called split horizon with poison reverse, if a node A routes through its neighbor B to get to the destination C$,$ then A will advertise to B that its distance to C is $\backslash$infty $.$ By doing so$,$ B will never attempt to route to C via A$,$ as long as A continues to route to C via B$.$