An Efficient Load Balancing Scheme for Gaming Server Using Proximal Policy Optimization Algorithm

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

Large amount of data is being generated in gaming servers due to the increase in the number of users and the variety of game services being provided. In particular, load balancing schemes for gaming servers are crucial consideration. The existing literature proposes algorithms that distribute loads in servers by mostly concentrating on load balancing and cooperative offloading. However, many proposed schemes impose heavy restrictions and assumptions, and such a limited service classification method is not enough to satisfy the wide range of service requirements. We propose a load balancing agent that combines the dynamic allocation programming method, a type of greedy algorithm, and proximal policy optimization, a reinforcement learning. Also, we compare performances of our proposed scheme and those of a scheme from previous literature, ProGreGA, by running a simulation.

키워드

Dynamic AllocationGreedy AlgorithmLoad BalancingProximal Policy OptimizationReinforcement Learning
제목
An Efficient Load Balancing Scheme for Gaming Server Using Proximal Policy Optimization Algorithm
저자
Kim, Hye-Young
DOI
10.3745/JIPS.03.0158
발행일
2021-04
유형
Article
저널명
JIPS(Journal of Information Processing Systems)
17
2
페이지
297 ~ 305