Loop-free paths in EIGRP

JJBladesterJJBladester Member Posts: 38 ■■□□□□□□□□
My book states:

"DUAL's method of guaranteeing that a neighbor has a loop-free path is that the neighbor's metric must satisfy the feasibility condition. By ensuring that the RD of the neighbor is less than its own FD, the router can assume that this neighboring router is not part of its own advertised route, thus always avoiding the potential for a loop."

How is ensuring that the reported distance of a neighbor is less than its own feasible distance avoid a potential loop?


Sign In or Register to comment.