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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Diffusing Update Algorithm canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T7427776 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Diffusing Update Algorithm Context triple: [EIGRP, algorithmFullName, Diffusing Update Algorithm]
-
A.
Paxos consensus algorithm
The Paxos consensus algorithm is a fault-tolerant protocol for achieving agreement among distributed systems, widely used as a foundation for reliable, replicated state machines and modern distributed databases.
-
B.
FLP impossibility result
The FLP impossibility result is a foundational theorem in distributed computing showing that in an asynchronous system, no deterministic consensus protocol can guarantee both safety and liveness in the presence of even a single crash failure.
-
C.
Raft consensus algorithm
Raft consensus algorithm is a distributed consensus protocol designed to be more understandable and easier to implement than Paxos while providing equivalent fault-tolerant guarantees.
-
D.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
E.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Diffusing Update Algorithm Target entity description: 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.
-
A.
Paxos consensus algorithm
The Paxos consensus algorithm is a fault-tolerant protocol for achieving agreement among distributed systems, widely used as a foundation for reliable, replicated state machines and modern distributed databases.
-
B.
FLP impossibility result
The FLP impossibility result is a foundational theorem in distributed computing showing that in an asynchronous system, no deterministic consensus protocol can guarantee both safety and liveness in the presence of even a single crash failure.
-
C.
Raft consensus algorithm
Raft consensus algorithm is a distributed consensus protocol designed to be more understandable and easier to implement than Paxos while providing equivalent fault-tolerant guarantees.
-
D.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
E.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
distributed algorithm
ⓘ
loop-free routing computation method ⓘ routing algorithm ⓘ |
| abbreviation | DUAL ⓘ |
| associatedWith | Cisco Systems ⓘ |
| 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 ⓘ |
| usedFor | intra-domain routing ⓘ |
| usedIn |
EIGRP
ⓘ
Enhanced Interior Gateway Routing Protocol ⓘ
linked to:
EIGRP
|
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Diffusing Update Algorithm Description of subject: 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.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.