Qianru Zhou

Qianru Zhou

Auto-generated profile, based on publicly available information

Qianru Zhou

School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
15 August 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
QZQianru Zhou
Qianru Zhou
BYBai Yin
Bai Yin
BCBaolei Cheng
Baolei Cheng
YWYan Wang
Yan Wang
HLHai Liu
Hai Liu
JFJianxi Fan
Jianxi Fan
Large-scale parallel and distributed applications and platforms rely heavily on high-performance network architectures, which greatly emphasize factors including network latency, bandwidth, communication reliability (e.g., connectivity and fault-tolerant routing), etc. Due to the expansion of network scales and the increase of component failures, the demand for the network’s high reliability has grown substantially. Enhancing fault tolerance is the key to improving the network’s reliability, which can be achieved by establishing the connectivity under the “ $g$ -good-neighbor condition”. In the presence of component failures, to maintain normal network operation and minimize communication delays, effective fault-tolerant routing strategies are required. This paper proposes a new class of recursive networks with small diameter, named generalized recursive match networks (GRMNs). GRMNs include well-known networks like generalized hypercubes, BC networks, BCube, HyperX, FBFLY, 2DFB, etc, and other future networks. We investigate the classical connectivity and $g$ -good-neighbor connectivity ( $g\geq 0$ ) of the GRMN. In addition, we present an $O(N)$ fault-tolerant unicast routing algorithm with the $g$ -good-neighbor faulty set, called F-TRouting, where N is the number of edges in the GRMN. The algorithm and results can be directly applied to all networks falling within the description of GRMNs, including generalized hypercubes, BC networks, BCube, HyperX, FBFLY, 2DFB, and other future networks. Finally, we give simulation experiment results on the performances of the GRMN and the F-TRouting algorithm, which demonstrate that the GRMN and the F-TRouting have advantageous performances.

29 June 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
WLWei Lin
Wei Lin
SZShuming Zhou
Shuming Zhou
MLMin Li
Min Li
GCGaolin Chen
Gaolin Chen
QZQianru Zhou
Qianru Zhou
Large-scale social graph data poses significant challenges for social analytic tools to monitor and analyze social networks. The information-theoretic distance measure, namely, resistance distance, is a vital parameter for ranking influential nodes or community detection. The superiority of resistance distance and Kirchhoff index is that it can reflect the global properties of the graph fairly, and they are widely used in assessment of graph connectivity and robustness. There are various measures of network criticality which have been investigated for underlying networks, while little is known about the corresponding metrics for mixed networks. In this paper, we propose the positive walk algorithm to construct the Hermitian matrix for the mixed graph and then introduce the Hermitian resistance matrix and the Hermitian Kirchhoff index which are based on the eigenvalues and eigenvectors of the Hermitian Laplacian matrix. Meanwhile, we also propose a modified algorithm, the directed traversal algorithm, to select the edges whose removal will maximize the Hermitian Kirchhoff index in the general mixed graph. Finally, we compare the results with the algebraic connectivity to verify the superiority of the proposed strategy.

1 January 2026 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
BYBai Yin
Bai Yin
QZQianru Zhou
Qianru Zhou
BCBaolei Cheng
Baolei Cheng
HLHai Liu
Hai Liu
YWYan Wang
Yan Wang
JFJianxi Fan
Jianxi Fan