Determining the g-component connectivity is still an unsolved problem in many interconnection networks. The g-component connectivity cκg(G) of G is the size of the smallest g-component cut. A g-component cut of G is a vertex set S such that G−S has at least g components. Let g≥0 be an integer and G be a connected graph. The component connectivity is an important parameter for the reliability evaluation of interconnection networks and is a generalization of the traditional connectivity. Reliability evaluation of interconnection networks is of significant importance to the design and maintenance of interconnection networks. In this paper, we obtain the h-restricted vertex diagnosability and the r-restricted edge diagnosability of some classes of regular networks under the HPMC model, which extend some results in Zhu et al. For any pair of vertices $u$ and $v$ of the connected graph $G$, if they are connected by $\min \, respectively, have been proposed under the HPMC model at the same time. The edge-fault-tolerance of networks is of great significance to the design and maintenance of networks. Moreover, the result is optimal with respect to the degree of Qn,m, and some experimental examples are provided to verify the theoretical result. It is shown that the n-dimensional bipartite enhanced hypercube network Qn,m is f-edge fault-tolerant k∗-laceable for every f≤n-1 and f k≤n 1. A bipartite graph H is f-edge fault-tolerant k∗-laceable if H-F is k∗-laceable for any edge set F of H with |F|≤f. A bipartite graph H with bipartition V0 and V1 is k∗-laceable if for any u∈V0 and v∈V1 there is a k∗-container between u and v. A k-container of G is a k∗-container if it contains all the vertices of G. A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. This paper investigates the problem of embedding spanning disjoint paths in the enhanced hypercube networks with edge fault tolerance. Embedding paths into a network topology is crucial for the network simulation. A complete design analysis, data routing and comparison of this network with basic networks is given using network parameters.In the design of an interconnection network, one of the most fundamental considerations is the reliability of the network, which can be usually characterized by the fault tolerance of the network. The advantages of hypercube network and torus topology are used for product network known as Torus embedded hypercube network. The product generated from torus and hypercube networks show how good interconnection network can be designed for parallel computation. A complete design analysis, data routing and comparison of this network with basic networks is given using network parameters.ĪB - This paper analyzes an embedded architecture of torus network with the hypercube pertinent to parallel architecture. N2 - This paper analyzes an embedded architecture of torus network with the hypercube pertinent to parallel architecture. T1 - A torus embedded hypercube scalable interconnection network for parallel architecture
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |