Disjoint Paths Construction and Fault-tolerant Routing in BCube of Data Center Networks

BCube is a promising structure of data center network, as it can significantly improve the performance of typical applications. With the expansion of network scale and increasement of complexity, reliability and stability of networks have become more essential. In this paper, we study the fault-tole...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2023-09, Vol.72 (9), p.1-14
Main Authors: Fan, Weibei, Xiao, Fu, Cai, Hui, Chen, Xiaobai, Yu, Shui
Format: Article
Language:English
Subjects:
Adaptive algorithms
Algorithms
BCube
Computer centers
Data center network
Data centers
Disjoint paths
Fault tolerance
Fault tolerant systems
Fault-tolerant routing
Multicast algorithms
Network latency
Nodes
Routing
Servers
System recovery
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:BCube is a promising structure of data center network, as it can significantly improve the performance of typical applications. With the expansion of network scale and increasement of complexity, reliability and stability of networks have become more essential. In this paper, we study the fault-tolerant routings in BCube. Firstly, we design a fault-tolerant routing algorithm based on node disjoint multi-paths. The proposed multi-path routing has stronger fault tolerance, since each path has no other common nodes except the source node and the destination node. Secondly, we investigate an effective fault-tolerant routing based on routing capabilities algorithm for BCube. The proposed algorithm has higher fault tolerance and success rate of finding feasible routes, since it does not limit the faults number. Thirdly, we present an adaptive path finding algorithm for establishing virtual links between any two nodes in BCube, which can shorten the diameter of BCube. Extensive simulation results show that the proposed routing scheme outperforms the existing popular algorithms. Compared with the state-of-the-art fault-tolerant routing algorithms, the proposed algorithm has a 21.5% to 25.3% improvement on both throughput and packet arrival rate. Meanwhile, it reduces the average latency of 18.6% and the maximum latency of 23.7% in networks.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2023.3251849