Fault-Tolerant Secure Routing Based on Trust Evaluation Model in Data Center Networks

Abstract

With the rise of cloud computing technology, the whole information technology industry has undergone dramatic changes. Large-scale computing and the growing demand for computing power from large data have made it impossible for traditional data center network topology construction methods and network layer operation control methods with good stability to meet the requirements of technological development. The topology of a data center network is usually characterized as an undirected graph, and graph algorithms are used to implement communication patterns in complex network structures. However, the routing algorithms proposed earlier for graphs cannot be applied to all topological graphs. Based on the comprehensive interactive trust evaluation network security model, this study analyzes the advantages and disadvantages of relevant algorithms and proposes a fault-tolerant routing algorithm suitable for all networks. The algorithm can dynamically call different algorithms according to the number of current nodes and links. From the simulation results, it can be found that the algorithm not only improves the accuracy and fault tolerance but also effectively reduces the loss of time and memory.