Haomai Shi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haomai Shi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Zhongjie Wang
Faculty of Computing, Harbin Institute of Technology
3 shared publications - Xiang He
Harbin Institute of Technology
2 shared publications - Feifei Chen
School of Information Technology, Deakin University, Melbourne, VIC, Australia
1 shared publication - Hanchuan Xu
Faculty of Computing, Harbin Institute of Technology, Harbin, China
1 shared publication - Qiang He
National Engineering Research Center for Big Data Technology and System, Services Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China
1 shared publication - Teng Wang
Harbin Institute of Technology
1 shared publication
Latest Publications
- 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.
- 20 November 2023
- Published by Springer Nature
- p. 258-272
ServiceSim: A Modelling and Simulation Toolkit of Microservice Systems in Cloud-Edge Environment
- 20 November 2023
- Published by Springer Nature
- p. 258-272
ServiceSim: A Modelling and Simulation Toolkit of Microservice Systems in Cloud-Edge Environment
- 3 June 2022
- Published by Springer Nature
- p. 517-532
How Big Service and Internet of Services Drive Business Innovation and Transformation
- 3 June 2022
- Published by Springer Nature
- p. 517-532
How Big Service and Internet of Services Drive Business Innovation and Transformation