Resource allocation in cloud computing via optimal control to queuing systems

We consider resource allocation problem in the cloud computing. We use queuing model to model the process of entering into the cloud and to schedule and to serve incoming jobs. In this paper, the main problem is to allocate resources in the queuing systems as a general optimization problem for controlled Markov process with finite state space. For this purpose, we study a model of cloud computing where the arrival jobs follow a stochastic process. We reduce this problem to a routing problem. In the case of minimizing, cost is given as a mixture of an average queue length and number of lost jobs. We use dynamic programming approach. Finally, we obtain the explicit form of the optimal control by the Bellman equation.