Yi Hu

Yi Hu

Auto-generated profile, based on publicly available information

Yi Hu

Hubei Key Laboratory of Internet of Intelligence, School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 September 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
YHYi Hu
Yi Hu
HWHao Wang
Hao Wang
LWLiangyuan Wang
Liangyuan Wang
MHMenglan Hu
Menglan Hu
KPKai Peng
Kai Peng
BVBharadwaj Veeravalli
Bharadwaj Veeravalli
Microservices are an architectural and organizational paradigm for Internet application development. In cloud data centers, delay-sensitive applications receive massive user requests, which are fed into multiple queues and subsequently served by multiple microservice instances. Accordingly, effective deployment of multiple queues and containers significantly reduces queuing delay, processing delay, and communication delay, boosting overall service performance. Due to the increased complexity of call dependencies, probabilistic routing paths, and microservice multiplexing, the deployment of service instances fully interacts with request routing, bringing great difficulties to service orchestration. In this case, it is valuable to simultaneously consider service deployment and request routing in a fine-grained manner. However, most existing studies considered them as two independent components with local optimization, while data dependencies and the deployment of multiple queues/containers are not well handled. Therefore, this paper proposes to jointly optimize the deployment and request routing of microservice call graphs based on fine-grained queuing network analysis and container orchestration. We first formulate the joint optimization problem as a mixed-integer nonlinear program and then exploit open Jackson queuing networks to model the intrinsic data dependencies and analyze response latency and microservice multiplexing. To optimize the overall cost and latency, this paper presents an efficient two-stage heuristic algorithm. The algorithm consists of a resource-splitting-based deployment approach and a partition-mapping-based routing method, which employ instance-level optimization to enhance performance. Further, this paper also provides mathematical analysis on the performance and complexity of the propose algorithm. Finally, comprehensive trace-driven experiments demonstrate that the overall performance of our approach is better than existing microservice benchmarks. Extensive simulation results show that average deployment cost is reduced by 27.4% and the end-to-end response latency is reduced by 15.1% on average.

19 August 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
MHMenglan Hu
Menglan Hu
HWHao Wang
Hao Wang
XXXiaohui Xu
Xiaohui Xu
JHJianwen He
Jianwen He
YHYi Hu
Yi Hu
KPKai Peng
Kai Peng
Edge computing technologies with container-based microservice architectures promise to provide stable and low-latency services for large-scale and complex edge applications. However, due to the limited CPU and storage resources in edge computing scenarios, the coarse-grained service deployment on edge nodes causes performance bottlenecks. In addition, the effective deployment of microservices is tightly correlated with request routing, but the current research ignores the joint optimization of multi-instance deployment and routing. In this paper, we first model the problem of jointly optimizing service deployment and routing in a dynamically changing environment with multi-edge network collaboration based on a queuing network analysis. Secondly, we design heuristic algorithms to scale microservice instances horizontally in dynamic user request states. In addition, we propose a reinforcement learning algorithm based on reward shaping (RSPPO) to minimize user waiting delay and edge network resource consumption. We also solve the microservice deployment and request routing problem for multi-edge collaboration to achieve load balancing among edge nodes. Finally, extensive experiments verify the significant and extensive effectiveness of our algorithm.

29 January 2025 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
LWLiangyuan Wang
Liangyuan Wang
XLXudong Liu
Xudong Liu
HDHaonan Ding
Haonan Ding
YHYi Hu
Yi Hu
KPKai Peng
Kai Peng
MHMenglan Hu
Menglan Hu
The emerging microservice architecture offers opportunities for accommodating delay-sensitive applications in edge. However, such applications are computation-intensive and energy-consuming, imposing great difficulties to edge servers with limited computing resources, energy supply, and cooling capabilities. To reduce delay and energy consumption in edge, efficient microservice orchestration is necessary, but significantly challenging. Due to frequent communications among multiple microservices, service deployment and request routing are tightly-coupled, which motivates a complex joint optimization problem. When considering multi-instance modeling and fine-grained orchestration for massive microservices, the difficulty is extremely enlarged. Nevertheless, previous work failed to address the above difficulties. Also, they neglected to balance delay and energy, especially lacking dynamic energy-saving abilities. Therefore, this paper minimizes energy and delay by jointly optimizing microservice deployment and request routing via multi-instance modeling, fine-grained orchestration, and dynamic adaptation. Our queuing network model enables accurate end-to-end time analysis covering queuing, computing, and communicating delays. We then propose a delay-aware reinforcement learning algorithm, which derives the static service deployment and routing decisions. Moreover, we design an energy-aware dynamic frequency scaling algorithm, which saves energy with fluctuating request patterns. Experiment results demonstrate that our approaches significantly outperform baseline algorithms in both delay and energy consumption.

20 January 2025 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
KPKai Peng
Kai Peng
YHYi Hu
Yi Hu
HDHaonan Ding
Haonan Ding
HCHaoxuan Chen
Haoxuan Chen
LWLiangyuan Wang
Liangyuan Wang
MHMenglan Hu
Menglan Hu
Service mesh architectures are emerging as a promising microservice paradigm for developing online cloud applications. However, in large-scale microservice scenarios, frequent service communications, intricate call dependencies, and stringent latency requirements bring great pressure to efficient service mesh orchestration. In this case, the problems of service deployment and request routing based on service mesh architectures are tightly-coupled and interdependent, and cannot be effectively optimized individually, enlarging the difficulty for collaborative orchestration. When microservice multiplexing, parallel dependencies, and multi-instance modeling are considered, the difficulty is further aggravated. Nonetheless, most existing work failed to propose appropriate models and methods for the above challenges. Therefore, this paper studies the large-scale service mesh orchestration with probabilistic routing and constrained bandwidths for parallel call graphs. We leverage the open Jackson queuing network theory to capture crucial microservices and analyze request processing, queuing, and communication latency for massive user requests in a fine-grained way. Then, this paper proposes an efficient three-stage heuristic, which achieves elegant multi-instance consolidation and probabilistic multi-queue routing to reduce response latency and cost. We also provide the algorithm complexity and mathematical analysis of the performance. Finally, extensive trace-driven experiments are performed to validate the superiority of our proposed algorithm over other baselines.

1 July 2026 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
KPKai Peng
Kai Peng
XLXudong Liu
Xudong Liu
DHDi Han
Di Han
YHYi Hu
Yi Hu
MHMenglan Hu
Menglan Hu
ZXZehui Xiong
Zehui Xiong

11 August 2025 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
YHYi Hu
Yi Hu
LHLiangbo Hou
Liangbo Hou
JHJunhui Hu
Junhui Hu
MRMingyuan Ren
Mingyuan Ren
MHMenglan Hu
Menglan Hu
KPKai Peng
Kai Peng
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-timescale trigger events. Finally, through comprehensive trace-driven experiments, our proposed approach significantly outperforms other baselines in terms of orchestration cost and resource utilization.