Limei Lin

Limei Lin

Auto-generated profile, based on publicly available information

Limei Lin

Fujian Normal University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 July 2017 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
LLLimei Lin
Limei Lin
LXLi Xu
Li Xu
RCRiqing Chen
Riqing Chen
SHSun-Yuan Hsieh
Sun-Yuan Hsieh
DWDajin Wang
Dajin Wang
The h-extra node-connectivity of a graph G is the size of a minimal node-set, whose removal will disconnect G, but each remaining component has no fewer h + 1 nodes. Based on h-extra node-connectivity, the h-extra conditional fault-diagnosability of networks has been proposed for a better, more realistic measure of networks' fault-tolerability. It is the maximal x such that G is h-extra conditionally x-fault-diagnosable. This paper will establish a relationship between the h-extra node-connectivity and h-extra conditional fault-diagnosability for a regular graph G, under the classic PMC diagnostic model. We will apply the newly found relationship to a variety of well-known regular networks, to directly obtain their h-extra conditional fault-diagnosability. The significance of the paper's work is that it relates the notions of h-extra node-connectivity and h-extra conditional fault-diagnosability, so that a regular network's h-extra conditional fault-diagnosability may be known once its h-extra node-connectivity is known.

23 January 2018 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
LLLimei Lin
Limei Lin
SHSun-Yuan Hsieh
Sun-Yuan Hsieh
RCRiqing Chen
Riqing Chen
LXLi Xu
Li Xu
CLChia-Wei Lee
Chia-Wei Lee
The g-restricted connectivity (g-RC) is the minimum vertex-set size of a network, whose deletion disconnects the network such that each remaining vertex has at least g neighbors in its respective component. The g-RC is a deterministic indicator of tolerability of a network with failing processors. The g-good-neighbor fault diagnosability (g-GNFD) is the largest set size of correctly identified faulty vertices in a network such that any good vertex has no fewer g good neighbors. This paper establishes the relationship between g-RC and g-GNFD of general regular networks, first under the PMC model and second under the MM* model. Moreover, this paper directly gives the g-GNFD of some well-known special networks by their g-RC and our proposed relationship.

3 February 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
JSJiankang Song
Jiankang Song
LLLimei Lin
Limei Lin
YHYanze Huang
Yanze Huang
SHSun-Yuan Hsieh
Sun-Yuan Hsieh
With the rapid increase of the number of processors in multiprocessor systems and the fast expansion of interconnection networks, the reliability of interconnection network is facing severe challenges, where the fast recognition of fault processors is crucial. In practice, most of the processor failures are intermittent faults. In this paper, we first determine the intermittent fault diagnosability $t_{I}^{PMC}(S_{n}^{2})$ of $n$ -dimensional split-star network $S_{n}^{2}$ under the PMC model. In addition, we propose a fast intermittent fault probabilistic diagnosis algorithm FIFPDPMC to identify the nodes with intermittent fault in the $n$ -dimensional split-star network $S_{n}^{2}$ under the PMC model, and we calculated the time complexity of the algorithm FIFPDPMC. Then we implement the algorithm FIFPDPMC in the IoT-based wireless sensor network (IoTWSN) and a randomly generated network (RGN) under different number of nodes with intermittent fault, and we evaluate the performance and efficiency of the algorithm FIFPDPMC in terms of accuracy, precision, recall (TPR), F1, G-mean, FPR, TNR and FNR. Experimental results show that, as the number of stages of executing the algorithm FIFPDPMC increases, the number of nodes with intermittent fault being diagnosed by the algorithm FIFPDPMC increases, which implies that the algorithm FIFPDPMC has good performance and efficiency in both IoTWSN and RGN.

28 December 2015 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
LLLimei Lin
Limei Lin
LXLi Xu
Li Xu
SZShuming Zhou
Shuming Zhou
SHSun-Yuan Hsieh
Sun-Yuan Hsieh
The $t/k$ -diagnosis strategy can significantly enhance the system’s self-diagnosing capability at the expense of no more than $k$ fault-free processors (vertices) being mistakenly diagnosed as faulty under the PMC model. It is a generalization of the precise and pessimistic diagnosis strategies of system-level diagnosis on multiprocessor systems. It can detect up to $t$ faulty processors (vertices) which might include at most $k$ misdiagnosed processors (vertices), where $k$ is typically a small number. In the case $k\ge 1$ , to our knowledge, there is no known $t/k$ -diagnosis algorithm for general regular networks. In this paper, we first propose a general $t/k$ -diagnosis ( $k\ge 1$ ) algorithm for some $m$ -regular networks. These $m$ -regular networks satisfying some conditions could establish the $t/k$ -diagnosis algorithm, say $t/k$ - $G$ -$DIAG$ , to determine the $t/k$ -diagnosability. The complexity of this algorithm is only $O(N\log N)$ (when $N\ge 2^m$ ) or $O(Nm)$ (when $N< 2^m$ ) where $N$ is the number of vertices in the network. Second, we present a complete proof that the network $G$ is actually $t/k$ -diagnosable. Finally, we establish the $t/k$ -diagnosability ( $1\le k\le 3$ ) of some regular networks, including an $n$ -dimensional alternating group graph , an $n$ -dimensional Split-Star Network , a $l^n$ -hypermesh and an $(n,l)$ -star graph , which are well-known interconnection networks proposed for multiprocessor systems.

29 June 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
LLLimei Lin
Limei Lin
YHYanze Huang
Yanze Huang
LXLi Xu
Li Xu
SHSun-Yuan Hsieh
Sun-Yuan Hsieh
The t/kt/k-diagnosability and hh-extra connectivity are regarded as two important indicators to improve the network reliability. The t/k-diagnosis strategy can significantly improve the self-diagnosing capability of a network at the expense of no more than k fault-free nodes being mistakenly diagnosed as faulty. The h -extra connectivity can tremendously improve the real fault tolerability of a network by insuring that each remaining component has no fewer than h+1 nodes. However, there is few result on the inherent relationship between these two indicators. In this article, we investigate the reason that caused the serious flawed results in (Liu, 2020), and we propose a diagnosis algorithm to establish the t/k-diagnosability for a large-scale connected network G under the PMC model by considering its h-extra connectivity. Let κ h (G) be the h-extra connectivity of G. Then, we can deduce that G is κ h (G)/h-diagnosable under the PMC model with some basic conditions. All κ h (G)faulty nodes can be correctly diagnosed in the large-scale connected network G and at most h fault-free nodes would be misdiagnosed as faulty. The complete fault tolerant method adopts combinatorial properties and linearly many fault analysis to conquer the core of our proofs. We will apply the newly found relationship to directly obtain the κ h (G)/h-diagnosability of a series of well known networks, including hypercubes, folded hypercubes, balanced hypercubes, dual-cubes, BC graphs, star graphs, Cayley graphs generated by transposition trees, bubble-sort star graphs, alternating group graphs, split-star networks, k-ary n-cubes and (n,k)-star graphs.

10 September 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
LLLimei Lin
Limei Lin
YHYanze Huang
Yanze Huang
DWDajin Wang
Dajin Wang
SHSun-Yuan Hsieh
Sun-Yuan Hsieh
LXLi Xu
Li Xu
The attackers in a network may have a tendency of targeting on a group of clustered nodes, and they hope to avoid the existence of significant large communication groups in the remaining network. This observation inspires a new measure for network reliability to resist the block attack by taking into account of the dispersity of the remaining nodes. Let G be a network, CV (G) and G[C] be a connected subgraph. Then C is called an h-faulty-block of G if G-C is disconnected, and every component of G-C has at least h+1 nodes. The minimum cardinality over all h-faulty-blocks of G is called h-faulty-block connectivity of G, denoted by FB h(G). In this paper, we determine FBh(Qn) for Qn, a classic interconnection network. We establish that FBh(Qn) = (h+2)n3h1 for 0h1, and FBh(Qn)=(h+2)n-4h+1 for 2hn-2. Larger h-faulty-block connectivity implies that an attacker need to attack a bigger block of connected nodes, so that there will not be great disparity in sizes between any two remaining components, and hence there will less likely be a significantly large remaining communication group. Our experiments also show that as h increases, the size of the largest remaining communication group becomes smaller.