Baoqing Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Baoqing Wang has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Gongming Zhao
School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
7 shared publications - Hongli Xu
School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
5 shared publications - Jiawei Liu
School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
5 shared publications Hongli Xu
2 shared publications- Junhong Lu
School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
2 shared publications - Long Li
University of Science and Technology of China
2 shared publications
Latest Publications
- Open Access
- 31 August 2026
- Published by Elsevier in SSRN Electronic Journal
COMPASS: Achieving Complementarity-Aware Service Deployment Scheme in Clouds
Service deployment in multi-tenant cloud clusters is critical to guarantee the quality of service.Most existing studies design deployment strategies based solely on the current resource demands of services.However, many nodes may be overloaded in the future due to the dynamic nature of services, necessitating scaling and redeploying, which leads to increased costs and degraded quality of service. We observe that the resource demands of services exhibit inverse patterns, called complementarity. Co-locating complementary services on the same node can smooth the aggregate resource usage and significantly alleviate node overload.Based on the insight, we propose a novel service deployment scheme that leverages service complementarity to reduce the incidence of node overload.First, we define an exponential-based node resource pressure function to model node overload conditions.Then, we formalize the service deployment as an optimization problem aiming to minimize the resource pressure function across the cluster over a time window, thereby promoting the co-location of services with complementary resource demands to prevent nodes from becoming overloaded. We provide a theoretical analysis showing the submodular structure of the resource-pressure reduction objective, which motivates an efficient greedy algorithm with scalable deployment performance.Comprehensive evaluations on real-world traces and a testbed demonstrate that COMPASS reduces total node resource pressure by 50\%–70\%, reduces the number of overloaded nodes by up to 91\%, and achieves up to 40.4\% lower p99 service request latency compared with commonly used approaches.
- 31 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCOMPASS: Achieving Complementarity-Aware Service Deployment Scheme in Clouds
Service deployment in multi-tenant cloud clusters is critical to guarantee the quality of service.Most existing studies design deployment strategies based solely on the current resource demands of services.However, many nodes may be overloaded in the future due to the dynamic nature of services, necessitating scaling and redeploying, which leads to increased costs and degraded quality of service. We observe that the resource demands of services exhibit inverse patterns, called complementarity. Co-locating complementary services on the same node can smooth the aggregate resource usage and significantly alleviate node overload.Based on the insight, we propose a novel service deployment scheme that leverages service complementarity to reduce the incidence of node overload.First, we define an exponential-based node resource pressure function to model node overload conditions.Then, we formalize the service deployment as an optimization problem aiming to minimize the resource pressure function across the cluster over a time window, thereby promoting the co-location of services with complementary resource demands to prevent nodes from becoming overloaded. We provide a theoretical analysis showing the submodular structure of the resource-pressure reduction objective, which motivates an efficient greedy algorithm with scalable deployment performance.Comprehensive evaluations on real-world traces and a testbed demonstrate that COMPASS reduces total node resource pressure by 50\%–70\%, reduces the number of overloaded nodes by up to 91\%, and achieves up to 40.4\% lower p99 service request latency compared with commonly used approaches.
- Open Access
- 29 August 2026
- Published by Elsevier in SSRN Electronic Journal
Achieving Anomaly Isolation through Tenant Deployment in Public Clouds
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.
- 29 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAchieving Anomaly Isolation through Tenant Deployment in Public Clouds
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.
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 491-504
Rethinking Cloud Optimization: Volatility-Driven for Better Outcomes
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%.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 491-504
Open AccessRethinking Cloud Optimization: Volatility-Driven for Better Outcomes
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%.
- 4 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. PP (00189340) , 1-17
Scalable High-fidelity Cloud Network Validation via Hybrid Architecture
Ensuring reliable operation of cloud networks is critical for cloud service providers to guarantee quality of service for tenants. A promising solution is to design a high-fidelity cloud network validation platform that proactively validates the correctness of all operations before implementing changes to the production network. However, the tight coupling between physical and virtual networks in the cloud poses challenges to achieving high-fidelity cloud network validation. Existing network validation platforms focus primarily on traditional physical networks, while ignoring virtual network validation. Regrettably, neglecting the combined validation of physical and virtual networks will result in inaccurate evaluations. To bridge this gap, we present HifiCNet, a high-fidelity platform that concurrently validates both physical and virtual networks. HifiCNet designs an orchestrator to elegantly coordinate the interaction between physical and virtual networks in the cloud and innovatively adopts an emulator-simulator hybrid architecture to ensure high fidelity and scalability for cloud network validation. Through extensive evaluation based on real topologies and traffic traces, we show that HifiCNet enables high-fidelity validation of cloud network configurations, services, and exceptions. Notably, HifiCNet can leverage 38 servers to establish a physical network comprising 10k hosts, as well as a virtual network consisting of 200k virtual machines.
- 4 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. PP (00189340) , 1-17
Scalable High-fidelity Cloud Network Validation via Hybrid Architecture
Ensuring reliable operation of cloud networks is critical for cloud service providers to guarantee quality of service for tenants. A promising solution is to design a high-fidelity cloud network validation platform that proactively validates the correctness of all operations before implementing changes to the production network. However, the tight coupling between physical and virtual networks in the cloud poses challenges to achieving high-fidelity cloud network validation. Existing network validation platforms focus primarily on traditional physical networks, while ignoring virtual network validation. Regrettably, neglecting the combined validation of physical and virtual networks will result in inaccurate evaluations. To bridge this gap, we present HifiCNet, a high-fidelity platform that concurrently validates both physical and virtual networks. HifiCNet designs an orchestrator to elegantly coordinate the interaction between physical and virtual networks in the cloud and innovatively adopts an emulator-simulator hybrid architecture to ensure high fidelity and scalability for cloud network validation. Through extensive evaluation based on real topologies and traffic traces, we show that HifiCNet enables high-fidelity validation of cloud network configurations, services, and exceptions. Notably, HifiCNet can leverage 38 servers to establish a physical network comprising 10k hosts, as well as a virtual network consisting of 200k virtual machines.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5052-5062
Meteor: High-Performance Control Message Delivery for Large-Scale Clouds
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.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5052-5062
Open AccessMeteor: High-Performance Control Message Delivery for Large-Scale Clouds
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.
- 9 April 2026
- Published by Springer Nature
- p. 3-23
Fossil: A Cost-Effective and Fault-Tolerant Task Placement Scheme for Geo-Distributed Clouds
- 9 April 2026
- Published by Springer Nature
- p. 3-23
Fossil: A Cost-Effective and Fault-Tolerant Task Placement Scheme for Geo-Distributed Clouds
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (9) , 1-14
Accelerating Distributed Training through In-Network Aggregation and Route Selection
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (9) , 1-14
Accelerating Distributed Training through In-Network Aggregation and Route Selection
- 2 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 1612-1627
Achieving High-Throughput and Reliable Cross-Cluster VPC Communication in Clouds
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.
- 2 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 1612-1627
Achieving High-Throughput and Reliable Cross-Cluster VPC Communication in Clouds
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.