The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model☆
Introduction
It is well-known that the network of a multiprocessor system can be represented by a graph. The hypercube [16], an important network for multiprocessor systems, has been applied to both commerce and research fields. In most hypercube multiprocessor architectures, each link is physically implemented by two opposite unidirectional channels. To reduce the cost and the complexity in constructing hypercube networks, Chou and Du [3] introduced the unidirectional hypercubes, which are the hypercube interconnection topologies with unidirectional edges. The most common parameters for evaluating the performance of unidirectional hypercubes such as connectivity, diameter and bandwidth have been studied [8], [10], [12], [17]. These results show that unidirectional hypercubes have comparable performance to the hypercubes.
With the rapid expansion of network-scale, the number of potential faults in a network is increasing. Therefore, it is significant to identify fault vertices in a network. This process is called the diagnosis of the network. The original diagnostic model for multiprocessor systems, known as the PMC model, was established by Preparata et al. [15]. In the PMC model, every processor tests a subset of its neighbors. Therefore, the self-diagnosable system can be represented by a directed graph (or digraph for short), where each vertex represents a processor and each arc uv represents a test from u to v. The outcome of the test uv is 0 if u evaluates v as fault-free; otherwise, the outcome of the test uv is 1. And the test outcome is reliable when u is fault-free; it is unreliable when u is faulty. The maximum number of faulty processors that a self-diagnosable system D can guarantee to identify is called the diagnosability of D, written as t(D). It should be pointed that the PMC model applies not only to networks of multiprocessor systems, but also to other networks, such as social networks and biological networks [1], [13].
The connectivity of graphs is an important measurement for fault tolerance of networks, which is closely related to the diagnosability [6], [21]. In practice, it is almost impossible for a fault set to contain all the neighbors of a vertex. Inspired by this observation, Esfahanian [5] proposed the notion of g-good-neighbor faulty sets for undirected graphs. Based on this, it is natural to introduce the g-good-neighbor connectivity and g-good-neighbor diagnosability as more accurate indexes than the classical connectivity and diagnosability [14], [23].
An undirected graph can be regard as a digraph in which uv is an arc if and only if vu is also an arc. As described above, when a multiprocessor system is represented by an undirected graph G, its self-diagnosable system is a sub-digraph of G. Therefore, the existence of a test from u to v does not mean the existence of the test from v to u, although the two linked processors u and v in G can communicate with each other. The g-good-neighbor connectivity and g-good-neighbor diagnosability of undirected graphs (in particular, hypercubes) have received a good deal of attention [7], [9], [18], [19], [20], [22], [23], [24]. However, there was hardly any corresponding result for digraphs. In this paper, we determine the 1-good-neighbor connectivity, diagnosability and 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model.
The remainder of this paper is organized as follows. Section 2 introduces the notions of g-good-neighbor connectivity and g-good-neighbor diagnosability of digraphs, and shows some basic properties of unidirectional hypercubes. In Section 3, we discuss the 1-good-neighbor (respectively, 1-good-in-neighbor and 1-good-out-neighbor) connectivity of unidirectional hypercubes. Section 4 determines the 1-good-neighbor (respectively, 1-good-in-neighbor and 1-good-out-neighbor) diagnosability of unidirectional hypercubes under the PMC model. Section 5 concludes the paper.
Section snippets
Preliminaries
We denote the vertex set and the arc set of a digraph D by V(D) and A(D), respectively. If uv ∈ A(D), then u is called an in-neighbor of v, and v is called an out-neighbor of u. For a vertex u of D, the in-neighborhood and the out-neighborhood of u in D are denoted by and respectively. The in-degree of u is the cardinality of . The minimum in-degree of D is . The out-degree of u and the minimum out-degree of D are defined analogously.
1-Good-neighbor connectivity of unidirectional hypercubes
Theorem 3.1 The connectivity of n-dimensional unidirectional hypercube UQn is .[10]
It is easily seen that UQ2 has neither 1-good-in-neighbor cuts nor 1-good-out-neighbor cuts. Therefore, we consider UQn with n ≥ 3 below. Theorem 3.2 Let n ≥ 3 be an integer. Then both the 1-good-in-neighbor connectivity and the 1-good-out-neighbor connectivity of UQn are that is, . Proof By (1), (2) and Theorem 3.1, and . Therefore, it is sufficient to show that
1-Good-neighbor diagnosability of unidirectional hypercubes under the PMC model
Lemma 4.1 Let n ≥ 2 be an integer and X be a minimum cut of UQn. Then there is x ∈ V(UQn) such that either or . Proof This statement is trivial when . Next, we assume that n ≥ 3 and let be an acyclic ordering of the strong components of . By definition, . If |V(D1)| ≠ 1 and |V(Dt)| ≠ 1, then both D1 and Dt contain cycles. Since we may assume, without loss of generality, that . By Theorems 3.1 and 3.4,
Conclusions
This paper investigates the connectivity and the diagnosability of unidirectional hypercubes under the PMC model. Table 1 summarizes the main results in this paper.
Let D be a digraph and let x be a vertex of D with minimum in-degree. Then and are indistinguishable. Therefore, . By this observation, if a spanning sub-digraph D of Qn is of diagnosability then the number of arcs in D is that is, the self-diagnosable
References (24)
- et al.
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
Theor. Comput. Sci.
(2016) - et al.
Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM* model of a graph
Discret. Appl. Math.
(2019) - et al.
On hamiltonian properties of unidirectional hypercubes
Inf. Process. Lett.
(2015) - et al.
The g-good-neighbor conditional diagnosability of hypercube under PMC model
Appl. Math. Comput.
(2012) - et al.
The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM* model
Inf. Process. Lett.
(2016) - et al.
The 2-good-neighbor diagnosability of cayley graphs generated by transposition trees under the PMC model and MM* model
Theor. Comput. Sci.
(2016) - et al.
The g-extra connectivity and diagnosability of crossed cubes
Appl. Math. Comput.
(2018) - et al.
The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
Discret. Appl. Math.
(2017) - et al.
On the t/k-diagnosability of BC networks
Appl. Math. Comput.
(2013) - et al.
g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks
Theor. Comput. Sci.
(2016)
Corruption detection on networks
J. Chem. Phys.
Digraphs: theory, algorithms and applications, springer publishing company
Incorporated
Cited by (6)
Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network
2024, Theoretical Computer Sciencer-component diagnosability of hypercubes under the PMC model
2022, Theoretical Computer ScienceThe diagnosability of wheel networks with the condition: 2-extra
2022, Theoretical Computer ScienceCitation Excerpt :Related results can be found in [4,7,8,11–15]. Peng et al. [9] extended the CD to another type of CD called the g-good-neighbor CD, where every fault-free node contains at least g fault-free neighbors [9,10,16–26]. Zhang et al. [27] extended the CD to the g-extra diagnosability, constraining that every fault-free component has more than g fault-free nodes.
The 1-good neighbor connectivity of unidirectional star graph networks
2021, Discrete Applied Mathematics