Abstract
The servers' competition for resources is a common phenomena in queueing systems. In this paper, we discuss the service rate control problem of queueing networks from a game theoretical perspective. The payoff function of each server is composed of two parts, the holding cost and the operating cost. Each server independently chooses their service rates in order to maximize their own average payoff. We formulate this problem as a game and prove that the average payoff of each server has a monotonic property. We further develop an iterative algorithm to find the Nash equilibrium of this game. Simulation experiments are conducted to demonstrate the main idea of the paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
