A fast convergence mechanism for distance-vector routing protocol

In order to solve the problem of routing protocols using the distributed Bellman-Ford (DBF) algorithm converge very slowly to the correct routes when link costs increase, and in the case when a set of link failures results in a network partition, we present a new fast converge distance vector routing algorithm CF-DVRP that uses suppression-failure strategy and multiple feasible backups per destination for every node to prevent the count-to-infinity problem. The analysis result show that CF-DVRP provide better network stability and availability and the simulation experiments show that CF-DVRP can deal with the multiple failures effectively.