Diffusing update algorithm
DUAL, the Diffusing Update ALgorithm, is the algorithm used by the EIGRP routing protocol to ensure that a given route is recalculated globally whenever it might cause a routing loop.
EIGRP uses a feasibility condition to ensure that only loop-free routes are ever selected. The feasibility condition is conservative: when the condition is true, no loops can occur, but the condition might under some circumstances reject all routes to a destination although some are loop-free.
When no feasible route to a destination is available, the DUAL algorithm[1] invokes a Diffusing Computation [2] to ensure that all traces of the problematic route are eliminated from the network. At which point the normal Bellman-Ford algorithm is used to recover a new route.
References
- ^ The DUAL Algorithm
- ^ Termination Detection for Diffusing Computations - Dijkstra, Scholten - 1980
 | This computer networking article is a stub. You can help Wikipedia by expanding it. |
d totoo ung sinasabi nito,,sinungaling