Two node-disjoint paths in balanced hypercubes

Cheng, Dongqin; Hao, Rong‐Xia; Feng, Yan-Quan

doi:10.1016/j.amc.2014.05.037

Cited by 39 publications

(23 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Next, we list the useful definitions and properties of local safety are proposed by Xiang [32,33] in order to prove that there are feasible paths under different safety conditions: Definition 2. (see [32,33]).…”

Section: E Balanced Hypercubementioning

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: E Balanced Hypercubementioning

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

“…Thus tasks running on a faulty processor can be shifted to its backup processor [26]. With such novel properties above, different aspects of the balanced hypercube are studied extensively, including Hamiltonian embedding issues [5,10,15,17,27,29,32], connectivity issues [18,31], matching preclusion and extendability [16,19], and symmetric issues [33,34] and some other topics [11,30]. In this paper, we will consider the problem of paired 2-DPC of the balanced hypercube with faulty edges.…”

Section: Introductionmentioning

confidence: 99%

Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges

Lü

2019

J Supercomput

View full text Add to dashboard Cite

The balanced hypercube BH n , a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that BH n is bipartite. Assume that S = {s 1 , s 2 , · · · , s 2n−2 } and T = {t 1 , t 2 , · · · , t 2n−2 } are any two sets of vertices in different partite sets of BH n (n ≥ 2). It has been proved that there exists paired 2-disjoint path cover of BH n . In this paper, we prove that there exists unpaired (2n − 2)-disjoint path cover of BH n (n ≥ 2) from S to T , which improved some known results. The upper bound 2n − 2 of the number of disjoint paths in unpaired (2n − 2)-disjoint path cover is best possible.

show abstract

“…A particular property of the balanced hypercube is that each processor has a backup processor that shares the same neighborhood. For more results about the balanced hypercubes, please refer to [4], [8]- [11].…”

Section: Introductionmentioning

confidence: 99%

Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes

Yang

Pai

Chang

et al. 2019

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

A set of spanning trees of a graphs G are called completely independent spanning trees (CISTs for short) if for every pair of vertices x, y ∈ V(G), the paths joining x and y in any two trees have neither vertex nor edge in common, except x and y. Constructing CISTs has applications on interconnection networks such as fault-tolerant routing and secure message transmission. In this paper, we investigate the problem of constructing two CISTs in the balanced hypercube BH n , which is a hypercube-variant network and is superior to hypercube due to having a smaller diameter. As a result, the diameter of CISTs we constructed equals to 9 for BH 2 and 6n − 2 for BH n when n 3. key words: interconnection networks, completely independent spanning trees, balanced hypercubes, diameter

show abstract

Two node-disjoint paths in balanced hypercubes

Cited by 39 publications

References 30 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

Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges

Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes

Contact Info

Product

Resources

About

Two node-disjoint paths in balanced hypercubes

Cited by 39 publications

References 30 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

Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges

Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes

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