An efficient topology reconfiguration algorithm under targeted attacks and failures

With the enhanced development of networks, management system has to meet different kinds of security and invulnerability challenges, such as unexpected changes of topology caused by targeted attack or failure, which disrupts existing traffic. In order to reduce the negative impact of topological changes on traffic, the topology needs to be adjusted in a short period of time before the recovery of the attacked node or the failure node. With the substantial flexibility offered by virtual network to implement new topology, how to calculate the new topology efficiently has become a hot topic of research. To achieve the goal, we present a novel algorithm based on the closeness centrality (CC) of nodes to reconfigure the topology in response to unexpected topological changes. The Efficient Topology Reconfiguration algorithm (ETR) reconfigures the topology by adding a fraction of links to the currently existing topology to satisfy the network requirements set before. We demonstrate the performance of the ETR algorithm and compare it with other algorithms. The experimental results show that we reconfigure the topology with the ETR algorithm more efficiently under targeted attacks and failures while ensuring the performance of reconfiguration.