Abstract

A new backup topology design method is proposed in this paper to solve the problem of network congestion during IP fast recovery rerouting. IP fast reroute establishes a series of backup topologies before single network failure, and uses a certain backup topology to reroute. The main previous work develops a method which determines the Key Nodes in process of creating the backup topology to separate traffic on high load links to the other links, utilizing the network topology and traffic matrix. In this paper, a new method to determine Key Nodes is designed, whose main idea is to select the Key Nodes according to the Betweenness Centrality and Closeness of nodes in backup topology, and then maximizes available links of Key Nodes. The experimental results show that maximum link load reduction is approximately 73% compared with the state of conventional algorithm, and maximum reduced hops is about 45% when single link failure. In addition, considering the location of the Key Nodes for a large network is a better strategy when using the Closeness algorithm to select the Key Nodes.

Full Text
Paper version not known

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 call

Disclaimer: 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.