An Efficient Load Balancing Scheme for Gaming Server Using Proximal Policy Optimization Algorithm
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Hye-Young | - |
dc.date.accessioned | 2021-09-02T02:42:07Z | - |
dc.date.available | 2021-09-02T02:42:07Z | - |
dc.date.created | 2021-08-18 | - |
dc.date.issued | 2021-04 | - |
dc.identifier.issn | 1976-913X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/15564 | - |
dc.description.abstract | 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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | KOREA INFORMATION PROCESSING SOC | - |
dc.title | An Efficient Load Balancing Scheme for Gaming Server Using Proximal Policy Optimization Algorithm | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Hye-Young | - |
dc.identifier.doi | 10.3745/JIPS.03.0158 | - |
dc.identifier.scopusid | 2-s2.0-85108222493 | - |
dc.identifier.wosid | 000669918100006 | - |
dc.identifier.bibliographicCitation | JOURNAL OF INFORMATION PROCESSING SYSTEMS, v.17, no.2, pp.297 - 305 | - |
dc.relation.isPartOf | JOURNAL OF INFORMATION PROCESSING SYSTEMS | - |
dc.citation.title | JOURNAL OF INFORMATION PROCESSING SYSTEMS | - |
dc.citation.volume | 17 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 297 | - |
dc.citation.endPage | 305 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.identifier.kciid | ART002715800 | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scopus | - |
dc.description.journalRegisteredClass | kci | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordAuthor | Dynamic Allocation | - |
dc.subject.keywordAuthor | Greedy Algorithm | - |
dc.subject.keywordAuthor | Load Balancing | - |
dc.subject.keywordAuthor | Proximal Policy Optimization | - |
dc.subject.keywordAuthor | Reinforcement Learning | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.