Vertex-disjoint paths in DCell networks

Wang, Xi; Fan, Jianxi; Lin, Cheng-Kuan; Jia, Xiaohua

doi:10.1016/j.jpdc.2016.05.001

Cited by 40 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wang et al [22] proposed an efficient algorithm for finding a disjoint paths in the node-to-set routing of DCell networks. Subsequently, they studied the Hamiltonian properties of DCell networks and extend it to all generalized DCell Hamiltonian-connected [23], the restricted h-connectivity [24], and vertexdisjoint paths in DCell networks successively [25]. Li et al [6] studied the diagnosability and g-good-neighbor conditional diagnosability of the data center network DCell.…”

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Zhang

2021

Security and Communication Networks

View full text Add to dashboard Cite

As the core infrastructure of cloud computing, a large scale of the data center networks (DCNs), which consist of millions of servers with high capacity, suffer from node failure such that the reliability is deteriorated. Malicious group could inevitably compromise the quality and reliability of data; thus, how to ensure the security routing of data is an urgent practical problem. As models for large-scale DCNs, it is worth mentioning the balanced hypercube, which is well-known for its strong connectivity, regularity, and a smaller diameter. Each of which makes a balanced hypercube a trustworthy model to deal with data traffic and provides a certain degree of fault-tolerance as well. In this paper, we use the balanced hypercube as a model for the data center networks and design a reliable safety level by referring to different safety levels of related subgraph. This subgraph contains the source and destination nodes, and the shortest feasible paths are located so that the reliable transmission is achieved. Then, we get that the length of fault-tolerant safety routing of data center networks based on balanced hypercube is always no greater than the Hamming distance plus two. Experiment shows that our fault-tolerant security routing scheme is more effective in the same reliable network environment of DCNs.

show abstract

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Zhang

2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Data center network research has become a popular aspect in academia and industry. Scholars have proposed many data center networks, for example, Fat-Tree [3], DCell [4][5][6], BCube [7,8], VL2 [9], CamCube [10], Ficonn [11], FSquare [12], BCDC [13,14], and so on. Because of its desirable features, such as symmetry, small diameter, high fault tolerance, and so on, BCube has become a main data center network.…”

Section: Introductionmentioning

confidence: 99%

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

Lin

You

2023

Mathematics

Self Cite

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

“…Let κ(G) be the connectivity of G. From Menger's theorem, there exist k node-disjoint paths between any pair of nodes a and b in G if k ≤ κ(G). The node-disjoint path problem has been studied for many networks, such as alternating group networks [1], balanced hypercubes [2], DCell networks [3], and so on. A set of k node-disjoint paths between a and b is called a k-container, denoted by C(a, b).…”

Section: Introductionmentioning

confidence: 99%

Super Spanning Connectivity of the Folded Divide-and-SwapCube

2023

View full text Add to dashboard Cite

A k*-container of a graph G is a set of k disjoint paths between any pair of nodes whose union covers all nodes of G. The spanning connectivity of G, κ*(G), is the largest k, such that there exists a j*-container between any pair of nodes of G for all 1≤j≤k. If κ*(G)=κ(G), then G is super spanning connected. Spanning connectivity is an important property to measure the fault tolerance of an interconnection network. The divide-and-swap cube DSCn is a newly proposed hypercube variant, which reduces the network cost from O(n2) to O(nlog2n) compared with the hypercube and other hypercube variants. The folded divide-and-swap cube FDSCn is proposed based on DSCn to reduce the diameter of DSCn. Both DSCn and FDSCn possess many better properties than hypercubes. In this paper, we investigate the super spanning connectivity of FDSCn where n=2d and d≥1. We show that κ*(FDSCn)=κ(FDSCn)=d+2, which means there exists an m-DPC(node-disjoint path cover) between any pair of nodes in FDSCn for all 1≤m≤d+2.

show abstract

Vertex-disjoint paths in DCell networks

Cited by 40 publications

References 22 publications

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

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

Super Spanning Connectivity of the Folded Divide-and-SwapCube

Contact Info

Product

Resources

About

Vertex-disjoint paths in DCell networks

Cited by 40 publications

References 22 publications

Fault-Tolerant Secure Routing of B H n -Based Data Center Networks

Fault-Tolerant Secure Routing of B H n -Based Data Center Networks

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

Super Spanning Connectivity of the Folded Divide-and-SwapCube

Contact Info

Product

Resources

About

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks