Multipath Fault-Tolerance Routing Mechanism in Data Center Network

This paper proposes a Fault-Tolerance Effect and Cost Function based Multipath Routing Mechanism (FEAC) in the Data Center Network (DCN). The path value is used to represent the quality of the path, measured by bandwidth, delay, packet loss rate and other information. We design a fault-tolerance effect and cost function, which is used to calculate optimal path numbers. The effect is expressed by the probability of selecting multiple paths to successfully transmit a flow. The fault-tolerance cost includes link congestion and elephant flow replication cost. Heuristic thoughts are adopted to design the algorithm of generating feasible path set. After the final path set is obtained, the data flow is copied and transmitted on it to improve the reliability of the network. The proposed algorithm is simulated on two network topologies; and it has a better performance than benchmark algorithms according to a variety of evaluation criteria.