Research On Dynamic Service Placement Problems Based On Control And Game Theory

Large-scale online service providers have been increasingly relying on geographically distributed cloud infrastructures for service hosting and delivery. In this context, a key challenge faced by service providers is to determine the locations where service applications should be placed such that the hosting cost is minimized while key performance requirements (e.g. response time) are assured. Furthermore, the dynamic nature of both demand pattern and infrastructure cost favors a dynamic solution to this problem. Currently most of the existing solutions for service placement have either ignored dynamics, or provided inadequate solutions that achieve both objectives at the same time. In this paper, we present a framework for dynamic service placement problems based on control-and game-theoretic models. In particular, we present a solution that optimizes the desired objective dynamically over time according to both demand and resource price fluctuations.We are through the dynamic service furnished single SP analysis of the problem, given a SP overall layout of dynamic service system architecture design, in this overall framework that we have a routing request, data collection, data analysis and data, resource control four modules. Constraints on the model of continuous treatment variables, let us put the problem into a very mature classified quadratic linear programming problem, the use of model predictive control for a single SP dynamic layout problems implementing the perfect solution. We point out that this model predictive control for handling dynamic service for SP problem has a very good layout model abstraction, it will be more SPs a unified control framework for the SPs a complete information between the information box. This allows us to easily put the problem in game theory to deal with. The introduction of a comprehensive welfare problems let us find an optimal Nash equilibrium. Integrated model predictive control algorithm, we give an excellent iterative approximation algorithms of dynamic service placement problem for multiplayer gaming.