Qiang-Sheng Hua

Qiang-Sheng Hua

Auto-generated profile, based on publicly available information

Qiang-Sheng Hua

School of Computer Science and Technology, Huazhong University of Science and Technology

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
12 March 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
WHWeifeng Hao
Weifeng Hao
JZJiajie Zeng
Jiajie Zeng
XDXiaohai Dai
Xiaohai Dai
Jiang XiaoJiang Xiao
Jiang Xiao
QHQiang-Sheng Hua
Qiang-Sheng Hua
HJHai Jin
Hai Jin
Blockchain technology offers an intelligent amalgamation of distributed ledger, Peer-to-Peer (P2P), cryptography, and smart contracts to enable trustworthy applications without any third parties. Existing blockchain systems have successfully either resolved the scalability issue by advancing the distributed consensus protocols from the control plane, or complemented the security issue by updating the block structure and encryption algorithms from the data plane. Yet, we argue that the underlying P2P network plane remains as an important but unaddressed barrier for accelerating the overall blockchain system performance, which can be discussed from how fast and reliable the network is. In order to improve the blockchain network performance about enabling fast and reliable broadcast, we establish a trust-enhanced blockchain P2P topology which takes transmission rate and transmission reliability into consideration. Transmission rate reflects blockchain network speed to disseminate transactions and blocks, and transmission reliability reveals whether transmission rate changes drastically on unreliable network connection. This paper presents BlockP2P-EP, a novel trust-enhanced blockchain topology to accelerate transmission rate and meanwhile retain transmission reliability. BlockP2P-EP first operates the geographical proximity sensing clustering, which leverages K-Means algorithm for gathering proximity peer nodes into clusters. It follows by the hierarchical topological structure that ensures strong connectivity and small diameter based on node attribute classification. Then we propose establishing trust-enhanced network topology. On top of the trust-enhanced blockchain topology, BlockP2P-EP conducts the parallel spanning tree broadcast algorithm to enable fast data broadcast among nodes both intra-and inter-clusters. Finally, we adopt an effective node inactivation detection method to reduce network load. To verify the validity of BlockP2P-EP protocol, we carefully design and implement a blockchain network simulator. Evaluation results show that BlockP2P-EP can exhibit promising network performance in terms of transmission rate and transmission reliability compared to Bitcoin and Ethereum.

17 December 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QHQiang-Sheng Hua
Qiang-Sheng Hua
YSYuliang Shi
Yuliang Shi
Dongxiao YuDongxiao Yu
Dongxiao Yu
HJHai Jin
Hai Jin
JYJiguo Yu
Jiguo Yu
HCHanhua Chen
Hanhua Chen
This paper studies the core maintenance problem for dynamic graphs which requires to update each vertex's core number with the insertion/deletion of vertices/edges. The state-of-the-art algorithms can either process one edge associated to a vertex in each iteration [14] or can only process one superior edge associated to the vertex in each iteration [25]. Thus for high superior-degree vertices insertions/deletions, these algorithms become very inefficient. We discovered a new structure called joint edge set whose insertions/deletions only make each vertex's core number change is at most 1. The joint edge set mainly contains all the superior edges associated with the high superior-degree vertices as long as these vertices are 3-hop independent.Our algorithms can process all edges in the joint edge set in one iteration and thus can greatly reduce the processing time. The results of extensive experiments conducted on various types of real-world, temporal and synthetic graphs illustrate that the proposed algorithms achieve good efficiency, stability and scalability. Specifically, the new algorithms can outperform the single-edge processing algorithms up to 4 orders of magnitude. Compared with the state-of-the art parallel algorithms in [14] and [25], our algorithms show a significant speedup up to 60x in the processing time.

11 May 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
HJHai Jin
Hai Jin
NWNa Wang
Na Wang
Dongxiao YuDongxiao Yu
Dongxiao Yu
QHQiang-Sheng Hua
Qiang-Sheng Hua
XSXuanhua Shi
Xuanhua Shi
XXXia Xie
Xia Xie
The core number of vertices is a basic index depicting cohesiveness of a graph, and has been widely used in large-scale graph analytics. In this paper, we study the update of core numbers of vertices in dynamic graphs with edge insertions/deletions, which is known as the core maintenance problem. Different from previous approaches that just focus on the case of single-edge insertion/deletion and sequentially handle the edges when multiple edges are inserted/deleted, we investigate the parallelism in the core maintenance procedure. Specifically, we show that if the inserted/deleted edges constitute a matching, the core number update with respect to each inserted/deleted edge can be handled in parallel. Based on this key observation, we propose parallel algorithms for core maintenance in both cases of edge insertions and deletions. Extensive experiments are conducted to evaluate the efficiency, stability, parallelism and scalability of our algorithms on different types of real-world, synthetic graphs and temporal networks. Comparing with former approaches, our algorithms can improve the core maintenance efficiency significantly.

15 May 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
Dongxiao YuDongxiao Yu
Dongxiao Yu
YZYifei Zou
Yifei Zou
JYJiguo Yu
Jiguo Yu
XCXiuzhen Cheng
Xiuzhen Cheng
QHQiang-Sheng Hua
Qiang-Sheng Hua
FLFrancis C. M. Lau
Francis C. M. Lau
We present a distributed stable protocol for local broadcast in multi-hop wireless networks, where packets are injected to the nodes continuously, and each node needs to quickly disseminate the injected packets to all its neighbors within a given communication range R. We investigate the maximum packet injection rate and the minimum packet latency that can be achieved in a stable protocol. This paper assumes the signal-to-interference-plus-noise-ratio (SINR) interference model, which reflects more accurately the physical characteristics of the wireless interference, such as fading and signal accumulation, than conventional local interference models, e.g., graph-based models. More specifically, we present a stable protocol that can handle both stochastic and adversarial injection patterns. The protocol is asymptotically optimal in terms of both injection rate and packet latency. To the best of our knowledge, this paper is the first one studying the properties of stable protocols for the basic primitive of local broadcast in a multi-hop setting under SINR. Our proposed protocol utilizes a static local broadcast algorithm as a subroutine. This static algorithm is of independent interest, and it closes the O(log n) gap between the upper and lower bounds for static local broadcast. Simulation results indicate that our proposed algorithms can perform well in realistic environments.

5 January 2021 in World Wide Web
Verified
Journal Article
Closed access
PDF file
WZWei Zhou
Wei Zhou
HHHong Huang
Hong Huang
QHQiang-Sheng Hua
Qiang-Sheng Hua
Dongxiao YuDongxiao Yu
Dongxiao Yu
HJHai Jin
Hai Jin
XFXiaoming Fu
Xiaoming Fu

1 January 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QHQiang-Sheng Hua
Qiang-Sheng Hua
YLYangyang Li
Yangyang Li
Dongxiao YuDongxiao Yu
Dongxiao Yu
HJHai Jin
Hai Jin
Graph partitioning is a fundamental problem to enable scalable graph computation on large graphs. Existing partitioning models are either streaming based or offline based. In the streaming model, the current edge needs all previous edges' partition choices to make a decision. As a result, it is hard to carry out partitioning in parallel. Besides, offline based partitioning requires full knowledge about the input graph which may not suit well for large graphs. In this work, we propose a quasi-streaming partitioning model and a game theory based solution for the edge partitioning problem. Specifically, we separate the whole edge stream into a series of batches where the batch size is a constant multiple of the number of partitions. In each batch, we model the graph edge partitioning problem as a game process, where the edge's partition choice is regarded as a rational strategy choice of the player in the game. As a result, the edge partitioning problem is decomposed into finding Nash Equilibriums in a series of game processes. We mathematically prove the existence of Nash Equilibrium in such a game process, and analyze the number of rounds needed to converge into a Nash Equilibrium. We further measure the quality of these Nash Equilibriums via computing the PoA (Price of Anarchy), which is bounded by the number of partitions. Then we evaluate the performance of our strategy via comprehensive experiments on both real-world graphs and random graphs. Results show that our solution achieves significant improvements on load balance and replication factor when compared with five exsiting streaming partitioning strategies.