Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures

Wanling, Lin; Li, Xiao-Yan; Chang, Jou–Ming; Jia, Xiaohua

doi:10.1109/tc.2022.3230288

Cited by 11 publications

(4 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [4], the two CISTs are investigated on P 4 -free graphs if and only if the graph G is a 2-connected graph of order n ≥ 4 and G / ∈ F , where F is a family of some graphs. Moreover, CISTs have been constructed in BCube-based datacenter networks [5] to provide an efficient fault-tolerant routing algorithms for transmitting data between data center components such as switches and servers. In [6], the authors provide two CISTs for a server-centric datacenter network, called CSDC, that is based on the crossed cube network.…”

Section: Introductionmentioning

confidence: 99%

Completely independent spanning trees in Eisenstein-Jacobi networks

Hussain,

AlAzemi,

AlBdaiwi

2024

J Supercomput

View full text Add to dashboard Cite

In this work, we propose construction algorithms to build Completely Independent Spanning Trees (CIST) in EJ networks with time complexity of O(n), where n is the total number of nodes in the network. We present a sequential and a parallel CISTs construction algorithms. Their communication complexities are O(d) and O(1), respectively, d is the tree depth. Based on the constructed CISTs, we developed a novel fault-tolerant communication algorithm that can be used for routing, broadcasting, and secure message distribution with O(n) time complexity. Simulation results of our work illustrate the average of maximum number of steps required to deliver a message from the root node of any CIST to any destination in all trees. CISTs shows that it is more reliable than ISTs in terms of root node failure and node loads.

show abstract

Section: Introductionmentioning

confidence: 99%

Completely independent spanning trees in Eisenstein-Jacobi networks

Hussain,

AlAzemi,

AlBdaiwi

2024

J Supercomput

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Completely Independent Spanning Trees in Eisenstein-Jacobi Networks

Hussain,

AlAzemi,

AlBdaiwi

2024

Preprint

View full text Add to dashboard Cite

In this work, we propose construction algorithms to build Completely Independent Spanning Trees (CIST) in EJ networks with time complexity of $O(n)$, where $n$ is the total number of nodes in the network. We present a sequential and a parallel CISTs construction algorithms. Their communication complexities are $O(d)$ and $O(1)$, respectively, $d$ is the tree depth. Based on the constructed CISTs, we developed a novel fault-tolerant communication algorithm that can be used for routing, broadcasting, and secure message distribution with $O(n)$ time complexity. Simulation results of our work illustrate the average of maximum number of steps required to deliver a message from the root node of any CIST to any destination in all trees. CISTs shows that it is more reliable than ISTs in terms of root node failure and node loads.

show abstract

“…Furthermore, Negara et al [13] confront BCube and DCell, finding out that the latter presents higher speed for data transmission, whilst the former achieve higher security and integrity in data transmissions. Some attempts have been made to enhance both designs, such as Lin et al [14] proposes an improvement on the former and Ahmed et al [15] presents a variation of the latter. Nonetheless, an alternative approach has been undertaken in this paper compared to those cited above, as it is based on statistical operations which are carried out by undertaking arithmetic operations applied to the number of hops away among hosts, thus accounting for an alternative manner to measure performance.…”

Section: Introductionmentioning

confidence: 99%

Study on Data Center Network Topologies for Monitoring Data using Edge/Fog Computing

ROİG,

ALCARAZ,

GILLY

et al. 2023

Journal of Polytechnic

View full text Add to dashboard Cite

The election of an appropriate data center network topology is key when dealing with surveillance and monitoring processes, such as those devoted to obtaining relevant data for sensor data fusion in any type of remote computing environment so as to perform fault diagnosis and prevention. In this paper, some of the most commonly used topologies to interconnect nodes within a data center bound to edge/fog computing, representing either switch-centric ones or server-centric ones, are reviewed and analyzed from a statistical point of view in order to measure their performance, resulting in server-centric ones doing it better.

show abstract

Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures

Cited by 11 publications

References 42 publications

Completely independent spanning trees in Eisenstein-Jacobi networks

Completely independent spanning trees in Eisenstein-Jacobi networks

Completely Independent Spanning Trees in Eisenstein-Jacobi Networks

Study on Data Center Network Topologies for Monitoring Data using Edge/Fog Computing

Contact Info

Product

Resources

About