A more efficient distance vector routing algorithm

A more efficient distance vector routing algorithm (EDVA) for computer networks is presented. EDVA is based on enhancements to two classes of distance vector algorithms: the path finding algorithms that report complete path information incrementally, and the diffusing update algorithm (DUAL) which is used in Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP) and is based on diffusing computations for internodal synchronization. EDVA operates by specifying a distance, a feasible distance, a predecessor and diffusing hops to each destination. This information is used together with diffusing computations of limited span to avoid routing-table loops. The correctness of EDVA is discussed, and its benefits compared with DUAL and path finding algorithms are illustrated with simple examples.