Diffusing update algorithm
The diffusing update algorithm (DUAL) 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. It was developed by J.J. Garcia-Luna-Aceves at SRI International. The full name of the algorithm is DUAL finite-state machine (DUAL FSM). EIGRP is responsible for the routing within an autonomous system, and DUAL responds to changes in the routing topology and dynamically adjusts the routing tables of the router automatically.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Communication100033020
- Direction106786629
- Event100029378
- Message106598915
- Procedure101023820
- Protocol106665108
- PsychologicalFeature100023100
- Rule105846932
- Rule106652242
- software
- WikicatInternetProtocols
- WikicatRoutingAlgorithms
- WikicatRoutingProtocols
- YagoPermanentlyLocatedEntity
- Comment
- enThe diffusing update algorithm (DUAL) 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. It was developed by J.J. Garcia-Luna-Aceves at SRI International. The full name of the algorithm is DUAL finite-state machine (DUAL FSM). EIGRP is responsible for the routing within an autonomous system, and DUAL responds to changes in the routing topology and dynamically adjusts the routing tables of the router automatically.
- Has abstract
- enThe diffusing update algorithm (DUAL) 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. It was developed by J.J. Garcia-Luna-Aceves at SRI International. The full name of the algorithm is DUAL finite-state machine (DUAL FSM). EIGRP is responsible for the routing within an autonomous system, and DUAL responds to changes in the routing topology and dynamically adjusts the routing tables of the router automatically. 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 invokes a diffusing computation 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.
- Hypernym
- Algorithm
- Is primary topic of
- Diffusing update algorithm
- Label
- enDiffusing update algorithm
- Link from a Wikipage to another Wikipage
- Algorithm
- Autonomous system (Internet)
- Bellman–Ford algorithm
- Category:Routing algorithms
- Category:Routing protocols
- Category:SRI International software
- Cisco
- EIGRP
- Enhanced Interior Gateway Routing Protocol
- Finite-state machine
- J.J. Garcia-Luna-Aceves
- Link-state routing protocol
- Metrics (networking)
- Network packet
- SRI International
- SameAs
- Diffusing update algorithm
- Diffusing Update Algorithm
- Diffusing Update Algorithm
- DUAL
- m.06l4g8
- nyNw
- Q185429
- الگوریتم انتشار بهروز
- Subject
- Category:Routing algorithms
- Category:Routing protocols
- Category:SRI International software
- WasDerivedFrom
- Diffusing update algorithm?oldid=890556599&ns=0
- WikiPageLength
- 6611
- Wikipage page ID
- 2085170
- Wikipage revision ID
- 890556599
- WikiPageUsesTemplate
- Template:Reflist