Zhaowu Huang

Zhaowu Huang

Auto-generated profile, based on publicly available information

Zhaowu Huang

Fuzhou University, Fuzhou, China and Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
19 December 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
SFShucun Fu
Shucun Fu
FDFang Dong
Fang Dong
DSDian Shen
Dian Shen
JZJinghui Zhang
Jinghui Zhang
ZHZhaowu Huang
Zhaowu Huang
QHQiang He
Qiang He
Federated edge learning (FEEL) is a promising collaborative paradigm, which employs edge devices (EDs) to train machine learning models for a federation. It opens countless opportunities to enable edge intelligence. The increasingly diversified demands for intelligent services are driving the deployment of various federations at the edge. Existing works on FEEL focus on a single federation and ignore inter-federation device competition and intra-device resource allocation, which hinders the applications of FEEL. To address this issue, this article first investigates the bottlenecks of executing multiple federations and builds a joint optimization model as a two-stage Stackelberg game involving device selection and resource allocation. To tackle the problem efficiently, we present a game-theoretical approach named D evice S election and R esource A llocation for M ultiple F ederations G ame (DSRAMF-G). First, following the arbitrary device selection of leaders (i.e., federations), the time cost minimization of followers (i.e., EDs) is modeled as a convex problem to obtain the optimal resource allocation. Then, based on followers' optimal responses, device selection is modeled as a congestion game. We prove the existence of the Nash equilibrium and propose a decentralized mechanism. Finally, extensive experiments show that DSRAMF-G significantly outperforms the state-of-the-art methods, achieving up to 5.9x training speedup and 2.8x resource-savings.

11 December 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XGXiaolin Guo
Xiaolin Guo
FDFang Dong
Fang Dong
DSDian Shen
Dian Shen
ZHZhaowu Huang
Zhaowu Huang
JZJinghui Zhang
Jinghui Zhang
Serverless Edge Computing (SEC) has gained widespread adoption in improving resource utilization due to its triggered event-driven model. However, deploying deep neural network (DNN) inference services directly in SEC leads to resource inefficiencies, which stem from two key factors. Firstly, existing methods adopt model-wise function encapsulation, which requires the entire DNN model to occupy memory throughout its execution lifecycle. This increases both memory footprint and occupancy time. Secondly, uniform DNN inference for diversity input leads to redundant computations and additional inference time. To this end, we propose REDI, a novel framework that leverages fine-grained block-wise function encapsulation and progressive inference to provide resource-efficient DNN inference while ensuring latency requirements. REDI enables the release of memory from already inferred shallow networks and allows each request to exit early based on input data complexity, eliminating redundant computations. To fully unleash the potential, REDI jointly considers resource heterogeneity, data diversity, and environment dynamics to investigate the block-wise function placement problem. We introduce an uncertainty-aware online learning-driven algorithm with bounded regret. Finally, we conduct extensive trace-driven experiments to evaluate our methods, demonstrating that REDI achieves a significant speedup of up to $6.52\times$ in terms of resource usage cost compared to state-of-the-art methods.

28 October 2024
Verified
Conference Paper
Open access
DYDaheng Yin
Daheng Yin
JSJianxin Shi
Jianxin Shi
MZMiao Zhang
Miao Zhang
ZHZhaowu Huang
Zhaowu Huang
JLJiangchuan Liu
Jiangchuan Liu
FDFang Dong
Fang Dong
Given the truly immersive viewing experiences, full-scene volumetric videos have received increasing attention from both academia and industry. Their vast data volumes, however, present significant challenges for real-time streaming over today's bandwidth-limited Internet. Considering the vast amount of full-scene volumetric data to be streamed and the limited bandwidth on the Internet, achieving adaptive full-scene volumetric video streaming over the Internet presents a significant challenge. Inspired by the advantages offered by neural fields, especially the feature grid method, we propose FSVFG, a novel full-scene volumetric video streaming system integrated feature grids as the representation of volumetric content. FSVFG employs an incremental training approach for feature grids and stores the features and residuals between adjacent grids as frames. To support adaptive streaming, we delve into the data structure and rendering processes of feature grids and propose bandwidth adaptation mechanisms. The mechanisms involve a coarse ray-marching for the selection of features and residuals to be sent, and achieve variable bitrate streaming by Level-of-Detail (LoD) and residual filtering. Based on these mechanisms, FSVFG achieves adaptive streaming by adaptively balancing the transmission of feature and residual according to the available bandwidth. Our preliminary results demonstrate the effectiveness of FSVFG, demonstrating its ability to improve visual quality and reduce bandwidth requirements of full-scene volumetric video streaming.

12 November 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZHZhaowu Huang
Zhaowu Huang
FDFang Dong
Fang Dong
HZHaopeng Zhu
Haopeng Zhu
MLMengyang Liu
Mengyang Liu
DSDian Shen
Dian Shen
BCBaijun Chen
Baijun Chen
Recently, edge-assisted methods have been proposed as a promising technique to deliver fast and accurate on-device video analytics by partitioning frame data and dispatching them to edge servers for parallel execution. However, the data partition reduces the detection latency but decreases accuracy since objects may cross the boundaries of adjacent blocks. The effect of data partition on the accuracy and latency depends on multiple vital parameters (e.g., target size, density, network, and computing resources.) in an unknown and time-varying fashion. Moreover, these parameters are determined by the application scenarios and edge environment, which are uncertain and heterogeneous at the edge. Hence, how to partition frames to strike a balance between accuracy and latency is a non-trivial and intractable problem. To this end, we propose an online learning-based device-edge-cloud collaboration framework, ADPTD, to guide data partition at the edge. We propose an optimal task dispatching algorithm (OTD) to minimize detection latency. Then, we propose a multi-armed bandit-based algorithm to pick a data partition strategy and invoke OTD to dispatch tasks in each time slot. Theoretical analysis reveals that ADPTD achieves sublinear regret. Extensive experimental results show that ADPTD outperforms the state-of-the-art methods, achieving a latency reduction of up to 2.53× and improving accuracy by up to 49.4%.

14 January 2026 in Knowledge-Based Systems
Verified
Journal Article
Closed access
LGLisha Gao
Lisha Gao
JTJing Tan
Jing Tan
HYHaoyu Yang
Haoyu Yang
ZXZhenxuan Xu
Zhenxuan Xu
ZHZhaowu Huang
Zhaowu Huang
SHShuo Han
Shuo Han

21 November 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XGXiaolin Guo
Xiaolin Guo
FDFang Dong
Fang Dong
DSDian Shen
Dian Shen
ZHZhaowu Huang
Zhaowu Huang
Serverless Edge Computing (SEC) has emerged as a promising paradigm for delivering low-latency, resource-efficient services for edge-native applications, which are implemented as dependent functions, forming Directed Acyclic Graph (DAG) workflows. Unfortunately, the application’s performance is hindered by the notorious issue of cold startup, especially in resource-constrained SEC environments. Layer-wise container caching has been proven to be an effective startup acceleration solution in SEC, due to its fine granularity and flexibility. However, due to the dynamic nature of call graphs and the skewness in function popularity in DAG workflows, as well as the heterogeneity of container layer cold start time and edge computing environments, the performance of existing layer-wise caching mechanisms degrades significantly. To solve this problem, we propose an efficient DAG workflow deployment method in SEC to minimize the application completion time (ACT) in the long term. We model the problem as a joint optimization of container layer-wise caching and function scheduling, which is a Time-coupled Integer Nonlinear Programming (TINLP) problem. To solve it, we first convert it to an Integer Linear Programming (ILP) problem and propose an online algorithm with theoretical performance guarantees. Extensive experiments demonstrate that our method achieves up to $2.92\times$ speedup in ACT reduction.