A Load Balancing Method Using K-means++ for P2P MMORPGs

In a P2P MMORPG, the game space is divided into multiple areas, and nodes are placed in each area to manage the game. If the load exceeds the processing capacity of the nodes, the game will be interrupted. Thus, the load needs to be distributed. A conventional study for a load balancing algorithm that detects the movement of players has been proposed to solve this problem. This method dynamically divides and combines the sub-areas by setting two thresholds: one for the upper limit and the other for the lower limit of the number of players that can exist in each sub-area. However, the load increases as the number of divided areas increases. In this study, we propose a novel load balancing algorithm to reduce the load using k-means++.