DARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing
Jose Joaquin Garcia-Luna-Aceves, Morteza Moghaddassian · 2024
EIGRP and some other routing protocols proposed recently attain loop-free routing by using diffusing computations, which were first proposed for the Diffusing Update Algorithm (DUAL) for loop-free shortest path routing. The basic approach to diffusing computations used in DUAL has remained unchanged since its introduction about 35 years ago. This paper presents DARE, a new approach to the implementation of diffusing computations that does not require changes to the signaling used in routing protocols based on diffusing computations. It is shown that DARE is much simpler than DUAL and results in faster convergence speeds.