EIGRP - Diffusing Update Algorithm - Local and Diffusing Computations in EIGRP
3 important questions on EIGRP - Diffusing Update Algorithm - Local and Diffusing Computations in EIGRP
What is Local computation in EIGRP?
- the Feasible successor providing the least CD is made the new Successor
- IF the CD over the new Successor is less than the current FD, the FD will be updated to the new CD; otherwise it stays at its current value
- The routing table is updated to the point toward the new successor
- If the current distance to the destination has changed as a result of switching to a new successor, an update packet is sent to all neighbors, advertising the router's updated distance to the destination
When is diffusing computation commenced (beginnen)?
After detecting a topology change and sent by a router that is NOT a feasible successor
What are the options when EIGRP sends a Query packet to all its neighbors? 2
1. Neighbor has successor and send reply packet with current distance to destination
2. Neighbor will join diffusing computations, sent out its own Query packet and advertise distance.
2. Neighbor will join diffusing computations, sent out its own Query packet and advertise distance.
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding
Remember faster, study better. Scientifically proven.
