4.5 Article

Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers

期刊

IEEE-ACM TRANSACTIONS ON NETWORKING
卷 30, 期 4, 页码 1689-1702

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2022.3147320

关键词

Servers; Routing; Data centers; Routing protocols; Fault tolerant systems; Fault tolerance; Data communication; Completely independent spanning trees (CISTs); data center networks (DCNs); edge computing; protection routing; RCube; server-centric networks

资金

  1. National Natural Science Foundation of China [62002062]
  2. Ministry of Science and Technology of Taiwan [MOST-110-2221-E-141004]

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

This paper introduces RCube as a candidate topology for edge computing DCNs and proposes a multi-protection routing scheme to enhance fault-tolerance capability.
The recently proposed RCube network is a cube-based server-centric data center network (DCN), including two types of heterogeneous servers, called core servers and edge servers. Remarkably, it takes the latter as backup servers to deal with server failures and thus achieve high availability. This paper first points out that RCube is suitable as a candidate topology of DCNs for edge computing. Three transmission types are among core and edge servers based on the demand for applications' computation and instant response. We then employ protection routing to analyze the transmission failure of RCube DCNs. Unlike traditional protection routing, which only tolerates a single link or node failure, we use the multi-protection routing scheme to improve fault-tolerance capability. To configure a protection routing in a network, according to Tapolcai's suggestion, we need to construct two completely independent spanning trees (CISTs), which are edge-disjoint and inner-vertex-disjoint spanning trees. It is well-known that the problem of determining whether there exists a dual-CIST (i.e., two CISTs) in a network is NP-complete. A logic graph of RCube, denoted by L-RCube(n,m,k), is a network with a recursive structure. Each basic building element consists of n core servers and m edge servers, where the order k is the number of recursions applied in the structure. In this paper, we provide algorithms to construct min{n,L(n+m)/2 RIGHT FLOOR} CISTs in L-RCube(n,m,k) for n+m >= slant 4 and n>1. From a combination of the multiple CISTs, we can configure the desired multi-protection routing. In our simulation, we configure up to 10 protection routings for RCube DCNs. As far as we know, in past research, there were at most three protection routings developed in other network structures. Finally, we summarize some crucial analysis viewpoints about the transmission efficiency of DCNs with heterogeneous edge-core servers from the simulation results.

作者

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

评论

主要评分

4.5
评分不足

次要评分

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

推荐

暂无数据
暂无数据