Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liangbo Hou

dblp:313/8898 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0007-6819-5325ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 91% Performance modeling and evaluation · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.912025
Time-Varying Microservice Orchestration With Routing for Dynamic Call Graphs via Multi-Scale Deep Reinforcement Learning · IEEE Trans. Serv. Comput. 2025
Cloud and datacenter computing › microservices
microservice orchestration
0.912025
Time-Varying Microservice Orchestration With Routing for Dynamic Call Graphs via Multi-Scale Deep Reinforcement Learning · IEEE Trans. Serv. Comput. 2025
Cloud and datacenter computing › datacenter services › online service systems
request routing
0.912025
Time-Varying Microservice Orchestration With Routing for Dynamic Call Graphs via Multi-Scale Deep Reinforcement Learning · IEEE Trans. Serv. Comput. 2025
Performance modeling and evaluation
queueing models
0.312025
Time-Varying Microservice Orchestration With Routing for Dynamic Call Graphs via Multi-Scale Deep Reinforcement Learning · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

markov decision process · 0.9jackson queueing network · 0.9deep reinforcement learning · 0.9
YearPublicationVenuePosition
2025 Time-Varying Microservice Orchestration With Routing for Dynamic Call Graphs via Multi-Scale Deep Reinforcement Learning
abstract
Lightweight microservices as a software architecture have been widely adopted in online application development. However, in highly-concurrent microservice scenarios, frequent data communications, complex call dependencies, and dynamic delay requirements bring great challenges to efficient microservice orchestration. In this case, service deployment and request routing are interactively-coupled in multi-instance modeling, and cannot be locally optimized effectively, thereby enlarging the difficulty for collaborative orchestration. To accommodate time-varying request properties and dynamic microservice multiplexing, orchestration schemes are frequently adapted to real-time parallel request queues, further complicating the difficulty. Nevertheless, most previous work failed to propose appropriate models and methods for the above issues. Therefore, this paper investigates the online microservice orchestration with probabilistic routing for dynamic call graphs in clouds. First, we formulate the time-slot-based joint optimization problem as a Markov Decision Process. The open Jackson queuing networks are used to accurately establish multi-instance models and analyze the request queuing, processing, and communicating delays. Then, we propose an efficient curiosity-driven deep reinforcement learning algorithm, which meticulously implements instance-level orchestration through multi-dimensional collaborative decisions and multi-time-scale trigger events. Finally, through comprehensive trace-driven experiments, our proposed approach significantly outperforms other baselines in terms of orchestration cost and resource utilization.
Liangbo Hou, Junhui Hu, Mingyuan Ren, Menglan Hu, Chao Cai 0001, Kai Peng 0001
IEEE Trans. Serv. Comput.2