The k-ary n-cube is one of the most attractive interconnection networks for parallel and distributed computing systems. In this paper, we investigate hamiltonian cycle path embeddings in n-cubes Qnk based on structure faults, which means each faulty element isomorphic to any connected subgraph a graph. Let H be graph with H∈{K1,K1,1,K1,2,K1,3}⁠. We show that two arbitrary distinct healthy nodes Qnk⁠, there exists fault-free connecting these if number at certain H. also These results mean can...

As a generalization of the star graph, (n,k)-star graph is one most important interconnection networks for parallel and distributed computing system. In this paper, we investigate fault-tolerant routing problem graphs under conditional fault assumption (CFA), where all neighbours any fault-free node cannot be faulty simultaneously. We show that, CFA, can tolerate up to n+k−4 nodes, there path length at diameter plus 6 between two nodes.

The k-ary n-cube is one of the most attractive interconnection networks for parallel and distributed computing system. In this paper, we investigate hamiltonian cycle path embeddings in 3-ary n-cubes Q <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> <sup xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> based on K xmlns:xlink="http://www.w3.org/1999/xlink">1,2</sub> -structure faults, which means each faulty element isomorphic to a...

The interconnetion network plays an important role in a parallel system. To avoid the edge number of interconnect scaling rapidly with increase dimension and achieve good balance hardware costs properties, this paper presents new interconnection called exchanged [Formula: see text]-ary text]-cube ([Formula: text]). Compared structures, text] shows better performance terms many metrics such as small degree fewer links. In paper, we first introduce structure present some properties text];...

Conditional connectivity and conditional faulty diameter have been proposed as two important parameters to estimate the fault tolerance of connect networks. In this paper, we consider (n,2)-star graph. arrive that graph S <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n,2</inf> is n-1, 5.

The k-ary n-cube is one of the most attractive interconnection networks for parallel and distributed computing systems. In this paper, we investigate Hamiltonian cycle path embeddings in 3-ary 3-cubes based on -structure faults, which means each faulty element isomorphic to any connected subgraph a graph K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1,3</sub> . We show that two arbitrary distinct healthy nodes 3-cube, there exists fault-free...

The medical sensor network is special application of WSNs. In a network, the users' information needs to be transmitted doctor workstation with smaller time delay. Meanwhile, reliability and energy consumption are necessary consider. This multi-objective path optimization because there exists conflict between these factors. Among research such problem, popular method converting it into single objective for analysis. Due belongs new interdisciplinary direction, does not much scholars exist...

Conditional connectivity and conditional fault diameter have been proposed as two important parameters in estimating the tolerance property of interconnection networks. In this paper, we consider properties (n, k)-star graphs through investigating diameter. We show that under assumption, where all neighbors any vertex cannot be faulty simultaneously, graph S <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n, k</sub> can tolerate up to n + k - 4...

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

The connectivity of a network is directly related to its reliability and fault tolerability, hence an important indicator the network's robustness. In this paper, we investigate fault-tolerant capabilities torus networks with respect K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1, 1</sub> -structure xmlns:xlink="http://www.w3.org/1999/xlink">1,1</sub> -substructure connectivity. graph G, denoted by κ(G; ), minimum cardinality set connected...