Secure paths based trustworthy fault-tolerant routing in data center networks

Abstract

With the continuous expansion scale of data center networks (DCNs), the probability of network failures becomes high. Trustworthy fault-tolerant routing is extremely significant for reliable communication in data centers. In this article, we tackle the challenge by proposing a novel fault-tolerant routing scheme for a torus-based DCN. First, we present a multipath information transmission model based on the trust degree of reachable paths and propose a novel Hamiltonian odd–even turning model without deadlock. Second, we design an efficient deadlock-free fault-routing algorithm by constructing the longest fault-free path between any two fault-free nodes in DCN. Extensive simulation results show that the proposed fault-tolerant routing outperforms the previous algorithms. Compared with the most advanced fault-tolerant routing algorithms, the proposed algorithm has a 21.5% to 25.3% increase in throughput and packet arrival rate. Moreover, it can reduce the average delay of 18.6% and the maximum delay of 23.7% in the network respectively.