EUVIMEDEUVIMED entdecken
Crossref

Energy-Aware Service Mesh Deployment and Online Request Routing in Edge: A Hierarchical Deep Reinforcement Learning Approach

Yi Hu, Junhui Hu, Yifei Yang, Menglan Hu, Kai Peng, Tianyue Zheng, Chao Cai, Zehui Xiong

IEEE Transactions on Mobile Computing · 2026-08 · 25 (8) · 13095-13115

DOI: 10.1109/tmc.2026.3674203 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, 2026-08. Verfasst von Yi Hu und 7 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 52 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Central Government Guided Local Science and Technology Development Fund Projects, Key Research and Development Program of Hubei Province, China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Service meshes built upon ubiquitous microservice architectures, as an emerging paradigm, promise to enhance the flexibility, scalability, and portability of energy-consuming and latency-sensitive applications in edge with limited resources. However, due to intricate microservice dependencies, service multiplexing, and parallel distributed instances, microservice deployment and request routing are highly interdependent. To reduce response latency and energy consumption, such collaborative optimization for efficient service mesh orchestration is necessary, but significantly challenging. Besides, strict service level objective (SLO) requirements and fine-grained latency analysis with multi-nest routing further impose great difficulties to online orchestration. When considering multi-instance modeling and multi-hop data communications for numerous microservices, the difficulty is extremely amplified. Nevertheless, most prevailing work failed to design sophisticate models and methods for addressing the above difficulties, and ignored the inherent transmission energy consumption for highly-concurrent multi-hop data interactions. Therefore, this paper investigates the energy-aware service mesh deployment and online request routing in edge. First, we establish a multi-instance queuing network model to accurately analyze the end-to-end response latency with complicated dependencies and multi-hop communications, and optimize energy consumption in a fine-grained manner. Then, to boost the overall performance, we design an efficient multi-dimensional hierarchical deep reinforcement learning algorithm, which enables edges and service instances to cooperate with each other to handle massively concurrent requests. Besides, we propose an energy-aware proactive autoscaling algorithm to carefully adapt to exceedingly dynamic scenarios. Finally, extensive experiments are performed to show our superior performance compared to other baselines.

Förderung

  • National Natural Science Foundation of China
  • Central Government Guided Local Science and Technology Development Fund Projects
  • Key Research and Development Program of Hubei Province, China
  • Fundamental Research Funds for the Central Universities

Zitieren

APA

Hu, Y., Hu, J., Yang, Y., Hu, M., Peng, K., Zheng, T., Cai, C., & Xiong, Z. (2026). Energy-Aware Service Mesh Deployment and Online Request Routing in Edge: A Hierarchical Deep Reinforcement Learning Approach. IEEE Transactions on Mobile Computing, 25(8), 13095-13115. https://doi.org/10.1109/tmc.2026.3674203

Vancouver

Hu Y, Hu J, Yang Y, Hu M, Peng K, Zheng T, et al. Energy-Aware Service Mesh Deployment and Online Request Routing in Edge: A Hierarchical Deep Reinforcement Learning Approach. IEEE Transactions on Mobile Computing. 2026;25(8):13095-13115. doi:10.1109/tmc.2026.3674203

BibTeX
@article{Hu2026,
  author = {Hu, Yi and Hu, Junhui and Yang, Yifei and Hu, Menglan and Peng, Kai and Zheng, Tianyue and Cai, Chao and Xiong, Zehui},
  title = {Energy-Aware Service Mesh Deployment and Online Request Routing in Edge: A Hierarchical Deep Reinforcement Learning Approach},
  journal = {IEEE Transactions on Mobile Computing},
  year = {2026},
  volume = {25},
  number = {8},
  pages = {13095--13115},
  doi = {10.1109/tmc.2026.3674203}
}
Kostenlos starten →