Diffusing Update Algorithm
E663645
Diffusing Update Algorithm is the loop-free, distributed routing computation method at the core of EIGRP that enables rapid, efficient route convergence in IP networks.
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
distributed algorithm
ⓘ
loop-free routing computation method ⓘ routing algorithm ⓘ |
| abbreviation | DUAL ⓘ |
| associatedWith | Cisco Systems NERFINISHED ⓘ |
| basedOn |
diffusing computations
ⓘ
distance vector principles ⓘ |
| comparedWith |
link-state routing algorithms
ⓘ
traditional distance-vector algorithms ⓘ |
| computes |
feasible successor routes
ⓘ
successor routes ⓘ |
| designedFor |
efficient routing computation
ⓘ
loop-free convergence ⓘ rapid route convergence ⓘ |
| domain |
IP routing
ⓘ
computer networking ⓘ |
| ensures | no routing loops during convergence ⓘ |
| feature |
queries neighbors during route recomputation
ⓘ
supports unequal-cost load balancing ⓘ uses feasibility condition for loop prevention ⓘ |
| goal |
avoid counting-to-infinity problem
ⓘ
minimize routing reconvergence time ⓘ |
| hasConcept |
active route
ⓘ
feasible distance ⓘ passive route ⓘ reported distance ⓘ |
| maintains |
feasible successor information
ⓘ
routing metrics ⓘ successor information ⓘ topology information ⓘ |
| metricComponent |
MTU
ⓘ
bandwidth ⓘ delay ⓘ load ⓘ reliability ⓘ |
| metricType | composite metric ⓘ |
| operatesAt | network layer ⓘ |
| property |
distributed operation
ⓘ
loop-free operation ⓘ supports fast convergence ⓘ supports incremental updates ⓘ supports multiple network topologies ⓘ |
| supportsProtocol |
IPv4
ⓘ
IPv6 ⓘ |
| usedBy | Cisco routers NERFINISHED ⓘ |
| usedFor | intra-domain routing ⓘ |
| usedIn |
EIGRP
NERFINISHED
ⓘ
Enhanced Interior Gateway Routing Protocol NERFINISHED ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.