Xiang He
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
Xiang He has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Zhongjie Wang
Faculty of Computing, Harbin Institute of Technology
13 shared publications Haomai Shi
Harbin Institute of Technology
3 shared publicationsTeng Wang
3 shared publications- Yin Chen
Faculty of Computing, Harbin Institute of Technology, Harbin, China
3 shared publications - Haomai Shi
Harbin Institute of Technology
2 shared publications - Quan Z. Sheng
Macquarie University
2 shared publications
Latest Publications
- 2 January 2026
- Published by Springer Nature
- p. 413-428
LEADR: A Lyapunov-Based Energy-Aware Decentralized Routing Strategy for Continuous UAV Communication Services
- 2 January 2026
- Published by Springer Nature
- p. 413-428
LEADR: A Lyapunov-Based Energy-Aware Decentralized Routing Strategy for Continuous UAV Communication Services
- Open Access
Plug-and-Play Parameter-Efficient Tuning of Embeddings for Federated Recommendation
With the rise of cloud-edge collaboration, recommendation services are increasingly trained in distributed environments. Federated Recommendation (FR) enables such multi-end collaborative training while preserving privacy by sharing model parameters instead of raw data. However, the large number of parameters, primarily due to the massive item embeddings, significantly hampers communication efficiency. While existing studies mainly focus on improving the efficiency of FR models, they largely overlook the issue of embedding parameter overhead. To address this gap, we propose a FR training framework with Parameter-Efficient Fine-Tuning (PEFT) based embedding designed to reduce the volume of embedding parameters that need to be transmitted. Our approach offers a lightweight, plugin-style solution that can be seamlessly integrated into existing FR methods. In addition to incorporating common PEFT techniques such as LoRA and Hash-based encoding, we explore the use of Residual Quantized Variational Autoencoders (RQ-VAE) as a novel PEFT strategy within our framework. Extensive experiments across various FR model backbones and datasets demonstrate that our framework significantly reduces communication overhead while improving accuracy. The source code is available at https://github.com/young1010/FedPEFT.
Open AccessPlug-and-Play Parameter-Efficient Tuning of Embeddings for Federated Recommendation
With the rise of cloud-edge collaboration, recommendation services are increasingly trained in distributed environments. Federated Recommendation (FR) enables such multi-end collaborative training while preserving privacy by sharing model parameters instead of raw data. However, the large number of parameters, primarily due to the massive item embeddings, significantly hampers communication efficiency. While existing studies mainly focus on improving the efficiency of FR models, they largely overlook the issue of embedding parameter overhead. To address this gap, we propose a FR training framework with Parameter-Efficient Fine-Tuning (PEFT) based embedding designed to reduce the volume of embedding parameters that need to be transmitted. Our approach offers a lightweight, plugin-style solution that can be seamlessly integrated into existing FR methods. In addition to incorporating common PEFT techniques such as LoRA and Hash-based encoding, we explore the use of Residual Quantized Variational Autoencoders (RQ-VAE) as a novel PEFT strategy within our framework. Extensive experiments across various FR model backbones and datasets demonstrate that our framework significantly reduces communication overhead while improving accuracy. The source code is available at https://github.com/young1010/FedPEFT.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (3) , 1748-1760
Crossport: A Cloud-Edge-End Microservice Architecture for Collaborative Rendering in Metaverse Services
The metaverse has evolved from a theoretical concept into a digital infrastructure with multiple simultaneous users, real-time interaction, and high-quality immersive experiences. Traditional architecture inherited from multiplayer gaming cannot adequately meet these requirements due to rendering pressure, battery life, device weight, and service cost. While Cloud and Edge XR architectures address some constraints by offloading computation, they introduce latency issues that com promise immersion. Edge-end collaborative rendering XR offers a promising direction but struggles with task decomposition, edge resource utilization, and practical infrastructure. This paper presents Crossport, a cloud-edge-end architecture that enables microservice-based collaborative rendering for metaverseser vices. Crossport introduces a scene-based microservice decomposition methodology, a composition toolchain supporting multiple consumers, and containerization middleware for integration with existing infrastructure. Experimental evaluation shows Crossport reduces edge resource consumption by up to 29.5% in single-user scenarios and 55.3% in multi-user contexts while maintaining high-quality immersive experiences.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (3) , 1748-1760
Crossport: A Cloud-Edge-End Microservice Architecture for Collaborative Rendering in Metaverse Services
The metaverse has evolved from a theoretical concept into a digital infrastructure with multiple simultaneous users, real-time interaction, and high-quality immersive experiences. Traditional architecture inherited from multiplayer gaming cannot adequately meet these requirements due to rendering pressure, battery life, device weight, and service cost. While Cloud and Edge XR architectures address some constraints by offloading computation, they introduce latency issues that com promise immersion. Edge-end collaborative rendering XR offers a promising direction but struggles with task decomposition, edge resource utilization, and practical infrastructure. This paper presents Crossport, a cloud-edge-end architecture that enables microservice-based collaborative rendering for metaverseser vices. Crossport introduces a scene-based microservice decomposition methodology, a composition toolchain supporting multiple consumers, and containerization middleware for integration with existing infrastructure. Experimental evaluation shows Crossport reduces edge resource consumption by up to 29.5% in single-user scenarios and 55.3% in multi-user contexts while maintaining high-quality immersive experiences.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3973-3982
PKGRec: Personal Knowledge Graph Construction and Mining for Federated Recommendation Enhancement
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3973-3982
Open AccessPKGRec: Personal Knowledge Graph Construction and Mining for Federated Recommendation Enhancement
- 30 October 2025
- Published by Elsevier in Ad Hoc Networks
- Vol. 181
RELTO: A reliability-oriented DRL approach with context-aware adaptive reward weighting for multi-objective task offloading in MEC
- 30 October 2025
- Published by Elsevier in Ad Hoc Networks
- Vol. 181
RELTO: A reliability-oriented DRL approach with context-aware adaptive reward weighting for multi-objective task offloading in MEC
- 20 October 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 176
EvoHRL: Joint optimization of fine-grained DNN partitioning and multi-instance deployment in edge computing
- 20 October 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 176
EvoHRL: Joint optimization of fine-grained DNN partitioning and multi-instance deployment in edge computing
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 3959-3972
KPath: Dependent and Redundant Task Execution Path Planning in Edge Service Networks
Edge servers cache applications as microservices to provide low-latency services to end-device users. Due to heterogeneous resource constraints, microservices supporting the same application may be distributed across multiple edge servers. When an end-device makes a request, it generates a task execution path comprising interconnected dependent microservices across the edge network. However, task execution time can vary significantly across these servers due to resource heterogeneity, unpredictable workloads, cyberattacks, and software exceptions. The interdependent nature of microservice execution makes single-path models highly vulnerable, as any failure or delay compromises the entire task chain. This paper formulates the Dependent Task Execution Path Planning (DTEP) problem-a novel NP-hard optimization that transforms single-path dependency models into robust multi-path redundancy frameworks. With a redundancy budget, it plans multiple redundant, shortest node-disjoint execution paths to enhance reliability and latency performance. To solve this complex problem efficiently, we propose KPath, a novel two-phase approximation algorithm consisting of base path generation followed by target path acquisition, offering a guaranteed approximation ratio of $O(m)$. Experimental results demonstrate that KPath efficiently generates path sets with average path lengths up to 17.87% shorter than modified state-of-the-art methods across various problem scales. Furthermore, when node issues occur, KPath achieves up to 26% reduction in communication latency through redundancy.
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 3959-3972
KPath: Dependent and Redundant Task Execution Path Planning in Edge Service Networks
Edge servers cache applications as microservices to provide low-latency services to end-device users. Due to heterogeneous resource constraints, microservices supporting the same application may be distributed across multiple edge servers. When an end-device makes a request, it generates a task execution path comprising interconnected dependent microservices across the edge network. However, task execution time can vary significantly across these servers due to resource heterogeneity, unpredictable workloads, cyberattacks, and software exceptions. The interdependent nature of microservice execution makes single-path models highly vulnerable, as any failure or delay compromises the entire task chain. This paper formulates the Dependent Task Execution Path Planning (DTEP) problem-a novel NP-hard optimization that transforms single-path dependency models into robust multi-path redundancy frameworks. With a redundancy budget, it plans multiple redundant, shortest node-disjoint execution paths to enhance reliability and latency performance. To solve this complex problem efficiently, we propose KPath, a novel two-phase approximation algorithm consisting of base path generation followed by target path acquisition, offering a guaranteed approximation ratio of $O(m)$. Experimental results demonstrate that KPath efficiently generates path sets with average path lengths up to 17.87% shorter than modified state-of-the-art methods across various problem scales. Furthermore, when node issues occur, KPath achieves up to 26% reduction in communication latency through redundancy.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (5) , 3008-3021
MicroForge: An Integrated Platform for Accelerating Experiments in Microservice Research With the Universal Evolution Model
The rapid adoption of microservice architectures has spurred research into addressing various challenges in microservice system evolution, such as service deployment and task offloading. While numerous solutions have been proposed by researchers, validating these approaches requires extensive experimentation, including both algorithmic testing and simulations across different Microservice-Based Applications (MBAs). However, current research lacks sufficient physical experimentation, which is essential for evaluating how these solutions perform when deployed on actual computing infrastructure with running microservice instances. This gap exists mainly because conducting physical experiments is complex and costly, primarily due to two barriers: the lack of standardized problem modeling approaches and the absence of suitable experimental platforms. To address these challenges, the Universal Evolution Model (UEM) was proposed that unifies different microservice research problems within a common evolution framework. This model frames research problems as approaches to evolve microservice systems under specific constraints to achieve desired objectives. Based on UEM and the widely-adopted Monitor-Analyze-Plan-Execute over a shared Knowledge (MAPE-K) model, a general Microservice System Evolution Architecture was designed that standardizes experimental processes across diverse research scenarios. Building on these foundations, MicroForge was presented, an open-source experimental platform equipped with tools for accelerating experiments. The platform incorporates RescueService, a carefully curated MBA. Through comprehensive evaluation across various MBAs, the functional effectiveness of MicroForge was validated. Additionally, a practical user guide was provided to facilitate the platform's adoption and utilization.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (5) , 3008-3021
MicroForge: An Integrated Platform for Accelerating Experiments in Microservice Research With the Universal Evolution Model
The rapid adoption of microservice architectures has spurred research into addressing various challenges in microservice system evolution, such as service deployment and task offloading. While numerous solutions have been proposed by researchers, validating these approaches requires extensive experimentation, including both algorithmic testing and simulations across different Microservice-Based Applications (MBAs). However, current research lacks sufficient physical experimentation, which is essential for evaluating how these solutions perform when deployed on actual computing infrastructure with running microservice instances. This gap exists mainly because conducting physical experiments is complex and costly, primarily due to two barriers: the lack of standardized problem modeling approaches and the absence of suitable experimental platforms. To address these challenges, the Universal Evolution Model (UEM) was proposed that unifies different microservice research problems within a common evolution framework. This model frames research problems as approaches to evolve microservice systems under specific constraints to achieve desired objectives. Based on UEM and the widely-adopted Monitor-Analyze-Plan-Execute over a shared Knowledge (MAPE-K) model, a general Microservice System Evolution Architecture was designed that standardizes experimental processes across diverse research scenarios. Building on these foundations, MicroForge was presented, an open-source experimental platform equipped with tools for accelerating experiments. The platform incorporates RescueService, a carefully curated MBA. Through comprehensive evaluation across various MBAs, the functional effectiveness of MicroForge was validated. Additionally, a practical user guide was provided to facilitate the platform's adoption and utilization.
- 7 December 2024
- Published by Springer Nature
- p. 54-68
An Energy-Efficient Partition and Offloading Method for Multi-DNN Applications in Edge-End Collaboration Environments
- 7 December 2024
- Published by Springer Nature
- p. 54-68
An Energy-Efficient Partition and Offloading Method for Multi-DNN Applications in Edge-End Collaboration Environments
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 1983-1997
An Efficient Algorithm for Microservice Placement in Cloud-Edge Collaborative Computing Environment
Microservices along with cloud-edge computing technologies are widely adopted to take advantage of the abundant computing resources of the cloud and the low latency, high bandwidth capabilities of the edge. However, factors such as frequent user requirement changes have made the current deployment scheme not fully adaptable to new requirements, resulting in an increase in average response time. Therefore, the microservice system needs to adjust the microservice deployment scheme online in response to continuously changing user requirements to reduce the average response time, which is known as the cloud-edge collaborative microservice deployment problem. However, existing methods are not able to meet the efficiency requirements and do not fully consider the complex dependencies of microservices and budget constraints in the cloud. To address this problem, this paper proposes a solution to the cloud-edge collaborative microservice deployment problem by modeling it as an NP-hard integer nonlinear programming problem in a cloud-edge environment consisting of private edge clouds and public cloud. An efficient Two-stage Iterated Greedy Optimization (TIGO) algorithm is also proposed and its convergence is proven. Extensive experimental results show that this approach achieves better average response times in less time compared to existing methods.
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 1983-1997
An Efficient Algorithm for Microservice Placement in Cloud-Edge Collaborative Computing Environment
Microservices along with cloud-edge computing technologies are widely adopted to take advantage of the abundant computing resources of the cloud and the low latency, high bandwidth capabilities of the edge. However, factors such as frequent user requirement changes have made the current deployment scheme not fully adaptable to new requirements, resulting in an increase in average response time. Therefore, the microservice system needs to adjust the microservice deployment scheme online in response to continuously changing user requirements to reduce the average response time, which is known as the cloud-edge collaborative microservice deployment problem. However, existing methods are not able to meet the efficiency requirements and do not fully consider the complex dependencies of microservices and budget constraints in the cloud. To address this problem, this paper proposes a solution to the cloud-edge collaborative microservice deployment problem by modeling it as an NP-hard integer nonlinear programming problem in a cloud-edge environment consisting of private edge clouds and public cloud. An efficient Two-stage Iterated Greedy Optimization (TIGO) algorithm is also proposed and its convergence is proven. Extensive experimental results show that this approach achieves better average response times in less time compared to existing methods.