Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Diffusing update algorithm

Network Algorithm

The diffusing update algorithm, usually called DUAL, is the routing algorithm inside Cisco's EIGRP protocol. Its job is to make sure a route is recalculated across the whole network whenever a change might otherwise cause a routing loop. J.J. Garcia-Luna-Aceves developed it at SRI International. EIGRP applies a conservative feasibility condition, so only routes that cannot loop are selected: a neighbour's reported distance must be smaller than the feasible distance of the current best route. When no feasible route remains, DUAL starts a diffusing computation that clears every trace of the bad route from the network, and the Bellman-Ford algorithm then recovers a new one. It keeps neighbour, topology and routing tables for this work.

Facts
Problem Solved
loop-free route recalculation 1
Connections

Credited To

Source Diffusing update algorithm (Wikipedia)

In Field

Source Diffusing update algorithm (Wikipedia)

Invented

Source Diffusing update algorithm (Wikipedia)
Sources
1. Diffusing update algorithm (Wikipedia)
  • Lead, problem solved
    to ensure that a given route is recalculated globally whenever it might cause a routing loop
  • Invented: J.J. Garcia-Luna-Aceves, Lead
    It was developed by J.J. Garcia-Luna-Aceves at SRI International.
  • Credited To: J.J. Garcia-Luna-Aceves, Lead, credited developer
    It was developed by J.J. Garcia-Luna-Aceves at SRI International.
  • In Field: Computer Networking, Lead
    is the algorithm used by Cisco's EIGRP routing protocol to ensure that a given route is recalculated globally whenever it might cause a routing loop
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.