Fast-Converging Distance Vector Routing Mechanism for IP Networks

Abstract

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 unavailable. We propose a new fast converge distance vector routing paradigm FC-DVRP where the goal is to reduce times of routes triggered convergence, in the meantime insure network availability. To this end, we present a suppression-failure strategy and multiple feasible backups per destination for every node. The analysis result show that FC-DVRP provide better network stability and availability, and the simulation experiments show that FC-DVRP can improve survivability of the network effectively.