HZHeng Zhang

Heng Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Heng Zhang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • pFedLoRA: Model-Heterogeneous Personalized Federated Learning with Homogeneous Low-Rank Adapter Sharing on Mobile Edge Devices

    by Liping Yi, Heng Zhang, Han Yu, Gang Wang, Xiaoguang Liu, Qinghua Hu

    Federated learning (FL) is an emerging machine learning paradigm in which a central server coordinates multiple participants (FL clients) collaboratively to train on decentralized data. In practice, FL often faces data, system, and model heterogeneity, which inspires the field of Model-Heterogeneous Personalized Federated Learning (MHPFL). However, existing MHPFL methods rely on extra public data or ignore the relationship between local private heterogeneous models and shared homogeneous models across clients. This leads to unsatisfactory model performance, computational overheads, and communication costs. To bridge this gap, we propose a novel and efficient model-heterogeneous personalized Federated learning framework (pFedLoRA) based on sharing homogeneous Low-Rank Adapter (LoRA) which is popular for fine-tuning pre-trained models. Specifically, we devise a lightweight homogeneous adapter, rather than apply the typical LoRA, to facilitate each client's heterogeneous local model training with our proposed iterative training for global-local bidirectional knowledge exchange. The homogeneous small local adapters are aggregated on the FL server to generate a global adapter. We theoretically prove its $\mathcal {O}(1/T)$ non-convex convergence rate. Experiments on 5 datasets demonstrate pFedLoRA outperforms 9 state-of-the-art baselines in model accuracy with $11.81 \times$ computation and $7.41\times$ communication cost saving.


  • CSQoS: Continual Sparse QoS Measurement for Edge Clouds With GNN-Based Variational Bayesian

    by Heng Zhang, Liping Yi, Xiaofei Wang, Wenyu Wang

    Edge computing, an emerging paradigm, utilizes decentralized edge nodes to offer low-latency, high-quality network services. Quality of service (QoS) is a crucial metric to measure the network service quality, and network resource scheduling relies on QoS measurement results. However, current QoS measurement methods often measure all QoS data among edge nodes; these dense measurement approaches introduce significant costs. In addition, edge nodes may adopt varied network access manners; these factors cause fluctuations in QoS between edge nodes. However, existing QoS measurement works often focus on measuring exact QoS values while merely considering QoS fluctuations, resulting in unreliable measured QoS data. In addition, existing QoS measurement methods often cannot support online QoS measurement, leading to stale offline QoS data affecting network resource scheduling. To tackle the two issues, we propose a novel continual sparse QoS (CSQoS) range measurement method with four innovative designs: First, to reduce measurement costs, we propose to measure QoS by only sampling partial QoS data and using them to impute unmeasured QoS data. To achieve sparse QoS imputation, we propose a novel variational Bayesian model (BayGNN) with an edge-enhanced graph neural network (GNN) as the encoder for feature extraction and a multilayer perceptron (MLP) as the decoder to predict unmeasured QoS data. Second, to assess QoS data ranges, we design the proposed BayGNN model to produce uncertainty simultaneously. Third, to fulfill reliable online QoS predictions, we incorporate continual learning and residual connections in BayGNN. Experimental results on two real-world datasets demonstrate that CSQoS has minimal QoS imputation error with the lowest measurement costs, reducing root mean square error (RMSE) of 17.6% and sampling costs of 20%.

  • Large-Scale Measurements and Optimizations on Latency in Edge Clouds

    by Heng Zhang, Shaoyuan Huang, Mengwei Xu, Deke Guo, Xiaofei Wang, Xin Wang, Victor C. M. Leung, Wenyu Wang

    The emergence of next-generation latency-critical applications places strict requirements on network latency and stability. Edge cloud, an instantiated paradigm for edge computing, is gaining more and more attention due to its benefits of low latency. In this work, we make an in-depth investigation into the network QoS, especially end-to-end latency, at both spatial and temporal dimensions on a nationwide edge computing platform. Through the measurements, we collect a multi-variable large-scale real-world dataset on latency. We then quantify how the spatial-temporal factors affect the end-to-end latency, and verify the predictability of end-to-end latency. The results reveal the limitation of centralized clouds and illustrate how could edge clouds provide low and stable latency. Our results also point out that existing edge clouds merely increase the density of servers and ignore spatial-temporal factors, so they still suffer from high latency and fluctuations. Based on a quantified latency impact factor, we have proposed several optimization strategies for edge cloud latency and validated their effectiveness. We also propose a robust prototype edge cloud model based on lessons we learn from the measurement and evaluate its performance in the production environment. Evaluation result shows that edge clouds achieve 84.1% latency reduction with 0.5ms latency fluctuation and 73.3% QoS improvement compared with the centralized clouds.


  • Open Access

    One for All: Unified Workload Prediction for Dynamic Multi-tenant Edge Cloud Platforms

    by Shaoyuan Huang, Zheng Wang, Heng Zhang, Xiaofei Wang, Cheng Zhang, Wenyu Wang

    Workload prediction in multi-tenant edge cloud platforms (MT-ECP) is vital for efficient application deployment and resource provisioning. However, the heterogeneous application patterns, variable infrastructure performance, and frequent deployments in MT-ECP pose significant challenges for accurate and efficient workload prediction. Clustering-based methods for dynamic MT-ECP modeling often incur excessive costs due to the need to maintain numerous data clusters and models, which leads to excessive costs. Existing end-to-end time series prediction methods are challenging to provide consistent prediction performance in dynamic MT-ECP. In this paper, we propose an end-to-end framework with global pooling and static content awareness, DynEformer, to provide a unified workload prediction scheme for dynamic MT-ECP. Meticulously designed global pooling and information merging mechanisms can effectively identify and utilize global application patterns to drive local workload predictions. The integration of static content-aware mechanisms enhances model robustness in real-world scenarios. Through experiments on five real-world datasets, DynEformer achieved state-of-the-art in the dynamic scene of MT-ECP and provided a unified end-to-end prediction scheme for MT-ECP.


  • Fine-Grained Spatio-Temporal Distribution Prediction of Mobile Content Delivery in 5G Ultra-Dense Networks

    by Shaoyuan Huang, Heng Zhang, Xiaofei Wang, Min Chen, Jianxin Li, Victor C. M. Leung

    The 5G networks have extensively promoted the growth of mobile users and novel applications, and with the skyrocketing user requests for a large amount of popular content, the consequent content delivery services (CDSs) have been bringing a heavy load to mobile service providers. As a key mission in intelligent networks management, understanding and predicting the distribution of CDSs benefits many tasks of modern network services such as resource provisioning and proactive content caching for content delivery networks. However, the revolutions in novel ubiquitous network architectures led by ultra-dense networks (UDNs) make the task extremely challenging. Specifically, conventional methods face the challenges of insufficient spatio precision, lacking generalizability, and complex multi-feature dependencies of user requests, making their effectiveness unreliable in CDSs prediction under 5G UDNs. In this article, we propose to adopt a series of encoding and sampling methods to model CDSs of known and unknown areas at a tailored fine-grained level. Moreover, we design a spatio-temporal-social multi-feature extraction framework for CDSs hotspots prediction, in which a novel edge-enhanced graph convolution block is proposed to encode dynamic CDSs networks based on the social relationships and the spatio features. Besides, we introduce the Long-Short Term Memory (LSTM) to further capture the temporal dependency. Extensive performance evaluations with real-world measurement data collected in two mobile content applications demonstrate the effectiveness of our proposed solution, which can improve the prediction area under the curve (AUC) by 40.5% compared to the state-of-the-art proposals at a spatio granularity of 76m, with up to 80% of the unknown areas.


  • A Measurement-Driven Analysis and Prediction of Content Propagation in the Device-to-Device Social Networks

    by Heng Zhang, Shaoyuan Huang, Xin Wang, Jianxin Li, Xiaofei Wang, Victor C. M. Leung

    In the 5 G era, data traffic has been growing rapidly. A small number of popular data files may dominate the network traffic and lead to heavy network congestion. Device-to-Device (D2D) communication can be used for caching and offloading significant data traffic. D2D social networks are instantiated paradigms of D2D communication. Existing studies maximize the performances of caching and offloading in D2D social networks by predicting potential content propagation paths. However, predicting such paths still faces many challenges, such as limitation of user spatial-temporal features, fragility of D2D social networks, and uncertainty of participants. As a solution, we first measure users' multi-dimensional features and content propagation paths to explore the distributions of D2D activities. Then we propose a D2D-LSTM model to predict complete content propagation paths hierarchically and design a prototype-user model for new participants. Experimental results demonstrate the state-of-the-art performances of D2D-LSTM. D2D-LSTM achieves at most 95% and at least 84.6% average precision in predicting terminal prototype-user class. Tree generation tests show that the generated trees have at most 64% and at least 17% similarity with ground-truth trees.


  • Multitask Offloading Strategy Optimization Based on Directed Acyclic Graphs for Edge Computing

    by Jiawen Chen, Yajun Yang, Chenyang Wang, Heng Zhang, Chao Qiu, Xiaofei Wang

    With the advancement of the user application service demands, the IoT system tends to offload the tasks to the edge server for execution. Most of the current studies on edge computation offloading ignore the dependencies between components of the application. The few pieces of research on edge computing offloading which focus on the topology of application are primarily applied in single-user scenarios. Unlike previous work, our work mainly solves dependent task offloading with edge computing in multiuser scenarios, which is more in line with reality. In this article, the dependent task offloading problem is modeled as a Markov decision process (MDP) first. Then, we propose an actor–critic mechanism with two embedding layers for directed acyclic graphs (DAGs)-based multiple dependent tasks computation offloading, namely, ACED, by jointly considering the topology of the application and the channel interference between several users. Finally, the results of simulations also show the priorities of the proposed ACED algorithm.