Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks

Pai, Kung-Jui; Chang, Jou–Ming

doi:10.1109/tnet.2019.2910019

Cited by 30 publications

(8 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, this conjecture has been proved to fail by counterexamples [23], [28]. For recent research results on CISTs and their applications, the reader can refer to [24]- [27] and references quoted therein. Here, we expressly point out that the construction of multiple ISTs and CIST are two different problems.…”

Section: Introductionmentioning

confidence: 99%

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

et al. 2021

Self Cite

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

et al. 2021

Self Cite

View full text Add to dashboard Cite

“…However, Hasunuma [12] early proved that the problem of determining whether there exists k CISTs in a graph is NP-complete, even for k = 2 (i.e., a dual-CIST). For more researches on constructing a dual-CIST or multiple CISTs on interconnection networks, please refer to [20,[22][23][24][25][26] and references quoted therein. In particular, the works in [22][23][24][25] discussed in-depth the configuration of protection routing.…”

Section: Introductionmentioning

confidence: 99%

“…For more researches on constructing a dual-CIST or multiple CISTs on interconnection networks, please refer to [20,[22][23][24][25][26] and references quoted therein. In particular, the works in [22][23][24][25] discussed in-depth the configuration of protection routing. In contrast, to the best of our knowledge, only a few studies of CISTs are related to DCNs.…”

Section: Introductionmentioning

confidence: 99%

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

Li¹,

Wanling²,

Chang³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

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 innervertex-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, (n + m)/2 } CISTs in L-RCube(n, m, k) for n + m 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.

show abstract

“…Currently, this conjecture has been proved to fail by counterexamples [21,26]. For recent research results on CISTs and their applications, the reader is referred to [22][23][24][25] and references quoted therein. Here, we explicitly point out that the construction of multiple ISTs and CIST are two different problems.…”

Section: Introductionmentioning

confidence: 99%

A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks

Kao

Klasing

Hung

et al. 2021

Algorithmic Aspects in Information and Management

View full text Add to dashboard Cite

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and secure message distribution. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Kao et al. [Journal of Combinatorial Optimization 38 (2019) 972-986] proposed an algorithm to construct independent spanning trees in bubble-sort networks. The algorithm is executed in a recursive function and thus is hard to parallelize. In this paper, we focus on the problem of constructing ISTs in bubble-sort networks Bn and present a non-recursive algorithm. Our approach can be fully parallelized, i.e., every vertex can determine its parent in each spanning tree in constant time. This solves the open problem from the paper by Kao et al. Furthermore, we show that the total time complexity O(n • n!) of our algorithm is asymptotically optimal, where n is the dimension of Bn and n! is the number of vertices of the network.

show abstract

Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks

Cited by 30 publications

References 45 publications

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

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

A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks

Contact Info

Product

Resources

About