Baoqing Wang

Baoqing Wang

Auto-generated profile, based on publicly available information

Baoqing Wang

School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications

2 December 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
LLLong Li
Long Li
GZGongming Zhao
Gongming Zhao
CXChu Xu
Chu Xu
HXHongli Xu
Hongli Xu
BWBaoqing Wang
Baoqing Wang
GLGangyi Luo
Gangyi Luo
The increasing demands of tenants are driving the growth of single virtual private cloud (VPC), leading to a trend towards cross-cluster VPC deployments, which fuels an increasing demand for cross-cluster VPC communication. However, the rapid growth of cross-cluster traffic and its inherently dynamic nature have exposed critical limitations in existing network solutions, which now struggle to maintain required throughput levels and ensure reliable communication. This growing inadequacy has consequently created persistent network performance bottlenecks in cross-cluster communication systems. To address this issue, we present HiReC, a system designed to achieve high-throughput and reliable cross-cluster VPC communication. To optimize throughput performance, HiReC leverages multiple gateways with a rounding-based mapping algorithm that ensures effective load balancing to forward cross-cluster traffic. Furthermore, HiReC augments gateway forwarding efficiency through implementation of the eXpress Data Path (XDP) framework, leveraging kernel-bypass techniques to accelerate packet processing. For reliability enhancement, HiReC employs a low-overhead, eBPF-based monitoring module and adaptive load adjustment mechanism to dynamically adjust traffic distribution among gateways, effectively handling gateway node or link failures. We implement our system and evaluate its performance through testbed experiments and simulation experiments. The results show that HiReC can effectively improve the throughput of cross-cluster communication and deal with abnormal events. For example, HiReC improves the throughput by $3.8\times $ and reduces the failure recovery latency by $19\times $ compared with state-of-the-art solutions.

12 April 2026
Verified
Conference Paper
Open access
GZGongming Zhao
Gongming Zhao
BWBaoqing Wang
Baoqing Wang
MCMin Chen
Min Chen
HXHongli Xu
Hongli Xu
JLJiawei Liu
Jiawei Liu
YXYing Xiong
Ying Xiong
Virtual private clouds (VPCs) play a critical role in providing secure and isolated network environments for web services. However, with the growing number and size of VPCs, efficiently delivering control messages from the control plane to the data plane has become a major concern for cloud vendors. Existing end-to-end transmission solutions (e.g., RPC) will result in substantial overhead in the control plane, while message-oriented middleware-based solutions (e.g., message queue) will lead to high data plane overhead. To address this issue, we design Meteor, a high-performance control message delivery system for large-scale clouds. Specifically, Meteor combines an RPC path with a message queue (MQ) path and employs an auto dual-path switching mechanism to minimize the message delivery latency. Additionally, we propose a VPC-based message delivery and filtering scheme for the MQ path to reduce data plane overhead. We also design a delivery robustness guarantee mechanism to ensure the reachability and consistency of control messages. Meteor has been thoroughly tested with up to 100k container instances. Evaluation results show that Meteor decreases the message delivery latency by 48.8% and reduces the overhead by about 50% in real-world scenarios, compared with state-of-the-art solutions.

29 August 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
BWBaoqing Wang
Baoqing Wang
SWShibo Wu
Shibo Wu
JLJiawei Liu
Jiawei Liu
GZGongming Zhao
Gongming Zhao
HXHongli Xu
Hongli Xu
Cloud vendors provide network services to tenants through shared service nodes, which may cause the abnormal traffic of one tenant to affect others. Deploying auxiliary systems such as firewalls will reduce the frequency of abnormal traffic occurrences but cannot eliminate them entirely. In practice, proper tenant deployment is a promising method to pursue anomaly isolation.Previous works have explored solutions along this line, such as controlling the impact scope of abnormal traffic to mitigate the influence of anomalies among tenants.However, these solutions cannot ensure full anomaly isolation among all tenants. That is, an anomaly in one tenant may cause complete service disruption for another tenant.To bridge the gap, we study the problem of multi-tenant \underline{\textbf{D}}eployment with \underline{\textbf{A}}nomaly \underline{\textbf{I}}solation (DAI), which is NP-hard.To address this problem, this paper introduces R-DAI, a rounding-based algorithm that can provide a tenant deployment solution in polynomial time, ensuring anomaly isolation among all tenants and load balancing.We implement our proposed algorithm on a small-scale physical testbed and a large-scale simulation.Both small-scale experimental results and large-scale simulation results show the superior performance of our proposed algorithm. For example, our algorithm eliminates tenant service disruptions caused by abnormal traffic and reduces the impact scope of a service node failure by 53\% compared with other alternatives.

1 January 2026 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
HXHongli Xu
Hongli Xu
BWBaoqing Wang
Baoqing Wang
JLJiawei Liu
Jiawei Liu
GZGongming Zhao
Gongming Zhao
JFJin Fang
Jin Fang
CQChunming Qiao
Chunming Qiao

11 August 2026
Verified
Conference Paper
Open access
BWBaoqing Wang
Baoqing Wang
GZGongming Zhao
Gongming Zhao
HXHongli Xu
Hongli Xu
SWShibo Wu
Shibo Wu
ZYZhuolong Yu
Zhuolong Yu
FMFanjie Meng
Fanjie Meng
Cloud providers commonly employ oversubscription strategies to maximize profitability, leveraging the significant gap between the resources purchased by tenants and those actually consumed by their workloads. However, the temporal volatility of workloads may lead to overload on oversubscribed nodes. To address this issue, existing works typically focus on designing reactive rescheduling mechanisms triggered by overload events or adopt conservative oversubscription strategies to mitigate overload risks. Nonetheless, these solutions compromise either tenant experience or provider profitability. In fact, reducing the temporal volatility of workloads is key to addressing the above challenges. We observe that many workloads exhibit temporal complementarity. Aggregating such workloads can effectively mitigate temporal volatility, thereby improving overall resource utilization. Motivated by this insight, we first design a new metric, called Maximum-based Coefficient of Variation (MCV), to quantify the temporal volatility of workloads. We then propose Hestia, a framework that achieves long-term stable oversubscription through workload aggregation. Specifically, we propose a smoothing-based method to classify workloads suitable for aggregation according to their periodicity. Subsequently, we design an aggregation algorithm to minimize the overall MCV, and treat the aggregated workloads as the units for oversubscription. Experimental results show that, using CPU as a representative example, Hestia reduces MCV by 43.3% and increases oversubscription profit by 66.74%.