Let´s depart together: Efficient play request dispatching in cloud gaming

In this paper, we study the problem of how to dispatch the play requests to the cloud servers in a cloud gaming system. We show that the dispatching strategy of play requests may heavily affect the total service cost of the cloud gaming system. The play request dispatching problem can be considered as a variant of the dynamic bin packing problem. However, we show that the classical bin packing algorithms such as First Fit and Best Fit are not efficient in dispatching the play requests in cloud gaming due to the diurnal workload pattern of online games. To address this issue, we propose an efficient request dispatching algorithm that assigns the play requests according to the predicted ending times of the game sessions. Through extensive evaluations using real online gaming traces, we show that the proposed dispatching algorithm can significantly reduce the resource waste of the cloud servers and thus decrease the total service cost compared to the First Fit and Best Fit algorithms.