4.5 Article

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

期刊

IEEE TRANSACTIONS ON COMPUTERS
卷 72, 期 9, 页码 2467-2481

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TC.2023.3251849

关键词

Routing; Fault tolerant systems; Fault tolerance; System recovery; Servers; Multicast algorithms; Data centers; BCube; data center network; disjoint paths; fault-tolerant routing

向作者/读者索取更多资源

This paper studies fault-tolerant routings in BCube data center network. A fault-tolerant routing algorithm based on node disjoint multi-paths is proposed, which has stronger fault tolerance. An effective fault-tolerant routing algorithm based on routing capabilities for BCube is investigated, which has higher fault tolerance and success rate. An adaptive path finding algorithm is presented to establish virtual links in BCube, which can shorten the diameter. Extensive simulations show that the proposed routing scheme outperforms existing algorithms, achieving significant improvements in throughput, packet arrival rate, and latency.
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. First, 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. Second, 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. Third, 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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据