With the continuous development of cloud computing technology

the microservice architecture has gradually become a widely used software design style. In microservice-based applications

different microservices collaborate with one another via interface calls

but they may also compete for limited resources during online evolvement. This poses new challenges for allocating resources efficiently during runtime. To tackle the problem

we propose a novel approach based on congestion game. Firstly

we use a weighted directed acyclic graph to model the inter-relationship of the microservices that compose an application. Then we use M/G/1 queue in queue theory to describe the arrival process of access requests

and combine it with the above graph to calculate the arrival rate of access requests to each microservice

which in turn is used to estimate response time in a newly-designed microservice revenue function. Finally

we define resources competing problem as a congestion game where each microservice is a player aiming to maximize its revenue

and propose an algorithm to find Nash equilibrium in polynomial time. Experiment results show that our approach can effectively improve the overall performance of the system with limited resources.