Linearly many faults in dual-cube-like networks (original) (raw)
Related papers
The generalized 3-connectivity and 4-connectivity of crossed cube
Discussiones Mathematicae Graph Theory
The generalized connectivity, an extension of connectivity, provides a new reference for measuring the fault tolerance of networks. For any connected graph G, let S ⊆ V (G) and 2 ≤ |S| ≤ V (G); κ G (S) refers to the maximum number of internally disjoint trees in G connecting S. The generalized k-connectivity of G, κ k (G), is defined as the minimum value of κ G (S) over all S ⊆ V (G) with |S| = k. The n-dimensional crossed cube CQ n , as a hypercube-like network, is considered as an attractive alternative to hypercube network because of its many good properties. In this paper, we study the generalized 3-connectivity and the generalized 4-connectivity of CQ n and obtain κ 3 (CQ n) = κ 4 (CQ n) = n − 1, where n ≥ 2.
Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
IEEE Transactions on Parallel and Distributed Systems, 2006
A paired many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. This paper is concerned with paired many-to-many disjoint path coverability of hypercube-like interconnection networks, called restricted HL-graphs. The class includes twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcubes, and generalized twisted cubes. We show that every restricted HL-graph of degree m with f or less faulty elements has a paired many-to-many k-DPC for any f and k ≥ 2 with f + 2k ≤ m. The result improves the known bound of f + 2k ≤ m − 1 by one.
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
19th IEEE International Parallel and Distributed Processing Symposium
We call a graph G to be f-fault hamiltonian (resp. ffault hamiltonian-connected) if there exists a hamiltonian cycle (resp. if each pair of vertices are joined by a hamiltonian path) in G\F for any set F of faulty elements with |F | ≤ f. In this paper, we deal with the graph G 0 ⊕ G 1 obtained from connecting two graphs G 0 and G 1 with n vertices each by n pairwise nonadjacent edges joining vertices in G 0 and vertices in G 1. Provided each G i is ffault hamiltonian-connected and f + 1-fault hamiltonian, 0 ≤ i ≤ 3, we show that G 0 ⊕G 1 is f +1-fault hamiltonianconnected for any f ≥ 2 and f + 2-fault hamiltonian for any f ≥ 1, and that for any f ≥ 0, H 0 ⊕ H 1 is f + 2-fault hamiltonian-connected and f + 3-fault hamiltonian, where
Design of interconnection networks for processor organization requires a comprehensive knowledge of implicit topological properties inherited by these networks. The architecture of novel interconnection networks is defined by its polylogrithmic time using polynomial number of processors. An undirected graph with processors as nodes and links between the processors as an edge represents a graphical model for interconnection networks with the assumption of the relation that processors are connected with a polynomial in polylogrithmic time. Star Graph, hypercube and a recently developed perfect difference network are popular interconnection networks of interest to researchers with principal to have efficient use of processors in minimal time with minimal connectivity. We restrict our attention to study and compare these interconnection networks topological properties. To measure the combinatorial properties of the compared interconnection networks, we had defined mapping function to map data according to the top ology of the interconnection network.
A Class ofParametric Regular Networks for Multicomputer Architecturesl
2000
Introd uction A new class of multicomputer interconnection networks is proposed and analyzed: Parametrically described, Regular, and based on Semigroups (PRS) networks (or R8(N,v,g) graphs with the order N, the degree v, the girth g, and the number of equivalence classes s). The class of PRS networks includes many classes of known networks (hypercubes, circulant networks, cube-connected cycles, etc.) as special cases. We explore the basic topological properties ( connectivity, isomorphism, lower bounds on the diameter and the average distance, etc.) of the proposed graphs and syn- thesize the optimal PRS networks having the minimal diameter for the given parameters of the graph. The PRS networks and their subclass -multidimensional circulants -are compared to hypercubes: the optimal P RS graph 's diameter is ~ O.211og2 N (for 9 = 6) and the circulant's diameter is ~ O.321og2 N whereas the hypercube 's diameter is log2 N, provided they have the same vertex and edge comple...
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science, 2007
In this paper, we deal with the graph G 0 ⊕ G 1 obtained from merging two graphs G 0 and G 1 with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices in G1. The main problems studied are how fault-panconnectivity and fault-pancyclicity of G 0 and G1 are translated into fault-panconnectivity and fault-pancyclicity of G 0 ⊕G 1 , respectively. Many interconnection networks such as hypercubelike interconnection networks can be represented in the form of G0 ⊕ G1 connecting two lower dimensional networks G 0 and G 1 . Applying our results to a class of hypercube-like interconnection networks called restricted HL-graphs, we show that in a restricted HL-graph G of degree m(≥ 3), each pair of vertices are joined by a path in G\F of every length from 2m − 3 to |V (G\F )| − 1 for any set F of faulty elements (vertices and/or edges) with |F | ≤ m − 3, and there exists a cycle of every length from 4 to |V (G\F )| for any fault set F with |F | ≤ m − 2.
The Conditional Fault-Diameter of the K-ary n-Cube
Sultan Qaboos University Journal for Science [SQUJS], 2005
We obtain the conditional fault diameter of the k-ary n-cube interconnection network. It has been previously shown that under the condition of forbidden faulty sets (i.e. assuming each non-faulty node has at least one non-faulty neighbor), the k-ary n-cube, whose connectivity is 2n, can tolerate up to 4n-3 faulty nodes without becoming disconnected. We extend this result by showing that the conditional fault-diameter of the k-ary n-cube is equal to the fault-free diameter plus two. This means that if there are at most 4n-3 faulty nodes in the k-ary n-cube and if every non-faulty node has at least one non-faulty neighbor, then there exists a fault-free path of length at most the diameter plus two between any two non faulty nodes. We also show how to construct these fault-free paths. With this result the k-ary n-cube joins a group of interconnection networks (including the hypercube and the star-graph) whose conditional fault diameter has been shown to be only two units over the fault...
The Folded Crossed Cube : A New Interconnection Network For Parallel Systems
International …, 2010
Study of parallel computer interconnection network topology has been made along with the various interconnection networks emphasizing the cube based topologies in particular. This paper proposes a new cube based topology called the Folded crossed cube with better features such as reduced diameter, cost and improved broadcast time, better fault tolerance and better message traffic density in comparison to its parent topologies: viz: hypercube and crossed cube. The one-to-one routing algorithm is also designed for the proposed network. The topological properties along with routing time are compared with the parent topologies and found to be better. Performance analysis in terms of cost, reliability is also done for the current network.