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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
