A secure data transmission scheme based on multi-protection routing in datacenter networks

Li, Xiao-Yan; Wanling, Lin; Guo, Wenzhong; Chang, Jou–Ming

doi:10.1016/j.jpdc.2022.05.010

Cited by 5 publications

(2 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6], the authors provide two CISTs for a server-centric datacenter network, called CSDC, that is based on the crossed cube network. Further, a fault-tolerant loop-free alternative paths for message transmission using a protection routing has been developed in [7] and utilized after constructing multiple CISTs in datacenter networks such as BCube networks.…”

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

“…It supports one-to-one and one-to-several traffic patterns [15]. It has good communication performances because it can build serveral vertex disjoint paths of shorter lengths [16]. The embedding of the path or the cycle is one of the main research topics in networks because many effective algorithms for solving various graph problems have been developed on the basis of paths and cycles [17][18][19][20] and some parallel applications [21,22].…”

Section: Introductionmentioning

confidence: 99%

A Novel Conditional Connectivity and Hamiltonian Connectivity of BCube with Various Faulty Elements

Lin

You

2023

Mathematics

View full text Add to dashboard Cite

BCube is one of the main data center networks because it has many attractive features. In practical applications, the failure of components or physical connections is inevitable. In data center networks in particular, switch failures are unavoidable. Fault-tolerance capability is one main aspect to measure the performance of data center networks. Connectivity, fault tolerance Hamiltonian connectivity, and fault tolerance Hamiltonicity are important parameters that assess the fault tolerance of networks. In general, the distribution of fault elements is scattered, and it is necessary to consider the distribution of fault elements in different dimensions. We research the fault tolerance of BCube when considering faulty switches and faulty links/edges that distribute in different dimensions. We also investigate the connectivity, fault tolerance Hamiltonian connectivity, and Hamiltonicity. This study better evaluates the fault-tolerant performance of data center networks.

show abstract

Fault-tolerant unicast using conditional local safe model in the data center network BCube

Hui

Wang

et al. 2023

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

A secure data transmission scheme based on multi-protection routing in datacenter networks

Cited by 5 publications

References 42 publications

Completely independent spanning trees in Eisenstein-Jacobi networks

Completely independent spanning trees in Eisenstein-Jacobi networks

A Novel Conditional Connectivity and Hamiltonian Connectivity of BCube with Various Faulty Elements

Fault-tolerant unicast using conditional local safe model in the data center network BCube

Contact Info

Product

Resources

About