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

Large amount of data is being generated in gaming servers due to the increase in the number of users and thevariety of game services being provided. In particular, load balancing schemes for gaming servers are crucialconsideration. The existing literature proposes algorithms that distribute loads in...

Full description

Saved in:
Bibliographic Details
Published in:Journal of information processing systems 2021, 17(2), 68, pp.297-305
Main Author: 김혜영
Format: Article
Language:English
Subjects:
컴퓨터학
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Large amount of data is being generated in gaming servers due to the increase in the number of users and thevariety of game services being provided. In particular, load balancing schemes for gaming servers are crucialconsideration. The existing literature proposes algorithms that distribute loads in servers by mostlyconcentrating on load balancing and cooperative offloading. However, many proposed schemes impose heavyrestrictions and assumptions, and such a limited service classification method is not enough to satisfy the widerange of service requirements. We propose a load balancing agent that combines the dynamic allocationprogramming 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. KCI Citation Count: 0
ISSN:1976-913X
2092-805X
DOI:10.3745/JIPS.03.0158