Qianru Zhou

dblp:170/6524 · DBLP profile ↗
← Back
14ranked-venue papers
8as first author
12since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 3 first-author · 8 since 2021Computer networks · 4 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 A Novel Protection Routing Scheme in Recursive Match Networks
Bai Yin, Qianru Zhou, Baolei Cheng, Hai Liu 0001, Yan Wang 0078, Jianxi Fan
IEEE Trans. Netw.2
2026 Reliable Communication Performance of Recursive Networks Based on Inter-Subgraph Matching
Qianru Zhou, Bai Yin, Baolei Cheng, Yan Wang 0078, Hai Liu 0001, Jianxi Fan
IEEE Trans. Netw.1
2024 An Extra Diagnosis Algorithm for Conditional Recursive Match Networks under the PMC Model
Qianru Zhou, Yan Wang 0078, Baolei Cheng, Jianxi Fan
WASA (2)1
2024 Reliability evaluation for a class of recursive match networks
Qianru Zhou, Baolei Cheng, Jingya Zhou, Jia Yu 0003, Yan Wang 0078, Jianxi Fan
Theor. Comput. Sci.1
2024 High fault-tolerant performance of the divide-and-swap cube network
Qianru Zhou, Jianxi Fan, Yan Wang 0078, Baolei Cheng
Theor. Comput. Sci.1
2023 Cluster Connectivity And Super Cluster Connectivity Of DQcube
abstract
Abstract As a fundamental metric, the connectivity to assess fault tolerance and reliability of interconnection networks has been extensively explored. However, classical connectivity is not very effective at evaluating large-scale networking systems. To overcome this deficiency, two new indices, cluster connectivity and super cluster connectivity, have been proposed to characterize the robustness of interconnection networks. This paper focuses on investigating $\mathcal{H} (\mathcal{H}^{*})$-cluster connectivity and super $\mathcal{H} (\mathcal{H}^{*})$-connectivity of composition graph $DQ_{n}$, based on disc-ring and hypercube, for $\mathcal{H}\in \{K_{1,r}\ |\ 0\leq r\leq n+1\}$, respectively. In detail, we show that $\kappa (DQ_{n}|K_{1,1} (K_{1,1}^{*}))=\kappa ^{\prime}(DQ_{n}|K_{1,1}(K_{1,1}^{*})) =n+1 (n\geq 3)$, $\kappa (DQ_{n}|K_{1,r}(K_{1,r}^{*})) =\left\lceil \frac{n}{2}\right\rceil +1 (2\leq r\leq 4)$ for $n\geq 3$, $\kappa ^{\prime}(DQ_{n}|K_{1}(K_{1}^{*})) =\kappa ^{\prime}(DQ_{n})=2n (n\geq 3)$, and for $2\leq r\leq 3$ and $k\geq 2$, $$\begin{align*} \kappa^{\prime}(DQ_{n}|K_{1,r}(K_{1,r}^{*}))=\left\{\begin{array}{@{}ll} n+1, & if\ n=2k+1; \\ n, & if\ n=2k. \end{array}\right. \end{align*}$$As by-products, we show that DQcube is super $K_{1,r}-\ (K_{1,r}^{*}-)$connected $(2\leq r\leq 3)$, and derive the 4-extra connectivity of DQcube $\kappa _{4}(DQ_{n}) = 5n-9 (n\geq 4)$.
Qianru Zhou, Shuming Zhou, Zhengqin Yu
Comput. J.1
2021 Fault Diagnosability of Regular Networks Under the Hybrid PMC Model
Jiafei Liu 0001, Qianru Zhou, Zhengqin Yu, Shuming Zhou
COCOON2
2021 Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern
Hong Zhang 0044, Shuming Zhou, Jiafei Liu 0001, Qianru Zhou, Zhengqin Yu
Discret. Appl. Math.4
2021 Reliability analysis of the cactus-based networks
Jiafei Liu 0001, Shuming Zhou, Eddie Cheng 0001, Qianru Zhou
Theor. Comput. Sci.4
2021 Fault diagnosability of Bicube networks under the PMC diagnostic model
Jiafei Liu 0001, Shuming Zhou, Zhendong Gu, Qianru Zhou, Dajin Wang
Theor. Comput. Sci.4
2021 Note on Rg-conditional diagnosability of hypercube
Cheng-Kuan Lin, Qianru Zhou, Shuming Zhou
Theor. Comput. Sci.3
2021 Structure and substructure connectivity of divide-and-swap cube
Qianru Zhou, Shuming Zhou, Jiafei Liu 0001
Theor. Comput. Sci.1
2019 ToCo: An Ontology for Representing Hybrid Telecommunication Networks
abstract
The TOUCAN project proposed an ontology for telecommunication networks with hybrid technologies – the TOUCAN Ontology (ToCo), available at http://purl.org/toco/ , as well as a knowledge design pattern Device-Interface-Link (DIL) pattern. The core classes and relationships forming the ontology are discussed in detail. The ToCo ontology can describe the physical infrastructure, quality of channel, services and users in heterogeneous telecommunication networks which span multiple technology domains. The DIL pattern is observed and summarised when modelling networks with various technology domains. Examples and use cases of ToCo are presented for demonstration.
Qianru Zhou, Alasdair J. G. Gray, Steve McLaughlin 0001
ESWC1
2019 BIDS: Bio-Inspired, Collaborative Intrusion Detection for Software Defined Networks
abstract
With network attacks becoming more sophisticated and unpredictable, detecting their onset and mitigating their effects in an automated manner become increasingly challenging. Lightweight and agile detection mechanisms that are able to detect zero-day attacks are in great need. High true-negative rate and low false-positive rate are the most important indicators for a intrusion detection system. In this paper, we exploit the logically-centralised view of Software-Defined Networking (SDN) to increase true-negative rate and lower false-positive rate in a intrusion detection system based on the Artificial Immune System (AIS). We propose the use of an antibody fuser in the controller to merge and fuse the mature antibody sets trained in the individual switches and turn the real intrusion records each switch has seen into antibodies. Our results show that both the false-positive rate and true-negative rate experience significant improvement with the number of local antibody sets fused grows, consuming less cpu usage overhead. A peak improvement can reach over 80% when antibody sets from all switches are taken into consideration.
Qianru Zhou, Dimitrios P. Pezaros
ICC1