Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Kuangyu Zheng has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A PPO-based Algorithm towards AoI-Aware Energy-Efficient UAV-assisted Data Collection

    by Jiaxi Zhao, Bingzhen Xie, Xin Cui, Aolin Zhang, Kuangyu Zheng, David López-Pérez

  • Bayesian-Driven Automated Scaling in Stream Computing With Multiple QoS Targets

    by Liang Zhang, Wenli Zheng, Kuangyu Zheng, Hongzi Zhu, Chao Li, Minyi Guo

    Stream processing systems commonly work with auto-scaling to ensure resource efficiency and quality of service (QoS). Existing auto-scaling solutions lack accuracy in resource allocation because they rely on static QoS-resource models that fail to account for high workload variability and use indirect metrics with much distractive information. Moreover, different types of QoS metrics present different characteristics and thus need individual auto-scaling methods. In this paper, we propose a versatile auto-scaling solution for operator-level parallelism configuration, called AuTraScale+, to meet the throughput, processing-time latency, and event-time latency targets. AuTraScale+ follows the Bayesian optimization framework to make scaling decisions. First, it uses the Gaussian process model to eliminate the negative influence of uncertain factors on the performance model accuracy. Second, it leverages the expected improvement-based (EI-based) acquisition function to search and recommend the optimal configuration quickly. Besides, to make a more accurate scaling decision when the new model is not ready, AuTraScale+ proposes a transfer learning algorithm to estimate the benefits of all configurations at a new rate based on existing models and then recommend the optimal one. We implement and evaluate AuTraScale+ on the Flink platform. The experimental results on three representative workloads demonstrate that compared with the state-of-the-art methods, AuTraScale+ can reduce 66.6% and 36.7% resource consumption, respectively, in the scale-down and scale-up scenarios while achieving their throughput and processing-time latency targets. Compared with other methods of optimizing event-time latency, AuTraScale+ saves 26.9% of resources on average.


  • Open Access

    Joint Efficient UAV Trajectory and Velocity Optimization for IoT Data Collection Using a New Projection Algorithm

    by Kuangyu Zheng, Zimo Ma, Mingyue Zhao, Zhuyang Zhou, Ziheng Zhang, Yifeng Li

    Unmanned aerial vehicle (UAV)-assisted networking and communications are increasingly used in different applications, especially in the data collection of distributed Internet of Things (IoT) systems; its advantages include great flexibility and scalability. However, due to the UAV’s very limited battery capacity, the UAV energy efficiency has become a bottleneck for longer working time and larger area coverage. Therefore, it is critical to optimize the path and speed of the UAV with less energy consumption, while guaranteeing data collection under the workload and time requirements. In this paper, as a key finding, by analyzing the speed–power and the speed–energy relationships of UAVs, we found that there should be different speed selection strategies under different scenarios (i.e., fixed time or fixed distance), which can lead to much-improved energy efficiency. Moreover, we propose CirCo, a novel algorithm that jointly optimizes UAV trajectory and velocity for minimized energy consumption. CirCo is based on an original projection method, turning a 3D problem (GN locations and transmission ranges on the 2D plane, plus the minimum transmission time requirements on the temporal dimensions) into a 2D problem, which could help to directly find the feasible UAV crossing window, which greatly reduces the optimization complexity. Moreover, CirCo can classify the projected conditions to calculate the optimal path and speed schedule under each category, so that the energy consumption of each situation can be fine-regulated. The experiments demonstrate that CirCo can save as much as 54.3% of energy consumption and 62.9% of flight time over existing approaches.


  • Distributed Traffic Flow Consolidation for Power Efficiency of Large-Scale Data Center Network

    by Kuangyu Zheng, Xiaorui Wang, Jia Liu

    Power optimization for data center networks (DCNs) has recently received increasing research attention, since a DCN can account for 10 to 20 percent of the total power consumption of a data center. An effective power-saving approach for DCNs is traffic consolidation, which consolidates traffic flows onto a small set of links and switches such that unused network devices can be shut down dynamically for power savings. While this approach has shown great promise, existing solutions are mostly centralized and do not scale well for large-scale DCNs. In this article, we propose DISCO, a DIS tributed traffic flow CO nsolidation framework, with correlation analysis and delay constraints, for large-scale data center network. DISCO features two distributed traffic consolidation algorithms that provide different trade-offs (as desired by different DCN architectures) between scalability, power savings, and network performance. First, a flow-based algorithm is proposed to conduct consolidation for each flow individually, with greatly improved scalability. Second, an even more scalable switch-based algorithm is proposed to consolidate flows on each individual switch in a distributed fashion. We evaluate the DISCO algorithms both on a hardware testbed and in large-scale simulations with real DCN traces. The results show that, compared with state-of-the-art centralized solutions, DISCO can achieve nearly the same power savings while decomposing the global problem into sub-problems that are three orders of magnitude smaller. As a result, DISCO can run $\mathbf {10^4}$ to $\mathbf {10^6}$ times faster for a DCN at the scale of 10K servers. The convergence of DISCO has also been proven theoretically and examined experimentally.


  • FCTcon: Dynamic Control of Flow Completion Time in Data Center Networks for Power Efficiency

    by Kuangyu Zheng, Yunhao Bai, Xiaorui Wang

    Data center network (DCN) can consume a significant amount of power (e.g., 10%-20%) in large-scale data centers. To reduce the power consumption of DCN, traffic consolidation has been recently proposed as an effective approach. However, existing approaches do not sufficiently consider the flow completion time (FCT) requirement. On one hand, missing the FCT deadlines can cause serious violation for delay-sensitive services (e.g., E-commerce). Moreover, keeping all devices on to make FCTs shorter than the requirements is unnecessary because users may not be able to perceive the difference while leading to unnecessarily high power consumption. Therefore, we propose FCTcon, a dynamic FCT control strategy for DCN power optimization. FCTcon is designed based on control theory to dynamically control the FCT of delay-sensitive traffic flows exactly to the requirements, such that the desired FCT performance is guaranteed while achieving maximum DCN power savings. Both hardware and simulation evaluation demonstrate FCTcon can improve the DCN FCT performance, while achieving nearly the same power savings. It provides 22.0%-62.2% extra net profits for a data center with 50K servers. In addition, we propose two extended designs of FCTcon to handle the coflow abstraction for DCN, which successfully reduce the coflow deadline miss ratio by 12%-15%.


  • Open Access

    PowerNetS: Coordinating Data Center Network With Servers and Cooling for Power Optimization

    by Kuangyu Zheng, Wenli Zheng, Li Li, Xiaorui Wang

    Recently, a lot of research efforts have been made to optimize the large amounts of energy consumed by different devices in data centers, including servers, cooling, and the data center network (DCN). Unfortunately, current research addresses these devices mostly in a separate manner, leading to inferior optimization results. This paper proposes PowerNetS, a power optimization framework that coordinates servers and DCN, as well as cooling, for minimized power consumption of a data center. PowerNetS leverages workload correlation analysis for more energy savings during server and traffic consolidations. More importantly, PowerNetS tries to change the DCN topology during server consolidation, in order to have more intra-server traffic and shorter flows that go through fewer switches. For example, two virtual machines previously located on two different servers can now be migrated to the same server, so that the flow between them no longer needs to use switches, which allows more devices to sleep for energy savings without network performance degradation. PowerNetS has been implemented on a physical testbed with 6 servers and 10 virtual switches that are configured using a production 48-port OpenFlow switch. Our evaluation with Wikipedia, Yahoo!, and IBM traces shows that PowerNetS can save up to 51.6% of energy by coordinating servers and DCN, which is 44.3% and 15.8% more than two state-of-the-art baselines, respectively. By further coordinating with cooling to utilize different cooling efficiencies at different locations within a data center, PowerNetS can achieve 8.8%-14.6% additional energy savings.