• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1034-1041
• /
• 2011

Generally, In distributed online game server system, game maps are processed separately by means of dividing into several unit blocks. But the keeping normal distribution of user in game map is very difficult because preferences of game users are not same according to individual user's private character. For this reason, if the huge number of users concentrate on particular region of same game map at once, the game server exceed their threshold so that the system can be getting down. Conversely, the efficiency of system goes down considerably because the game server must perform map processing continuously even under user_empty situation. To solve this problem, in this paper, we propose a Map management method to control relatively normal distribution of users in game maps using Map Balance Server. In suggested model, we can reduce the load of game servers by means of turn off the game map processing temporary when a server is under user_empty situation. we also can maximize server performance by means of redistribution of map processing load among servers.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.303-305
• /
• 2005

In MMORPG, gamers can engage in a variety of activities with other players from all over the world. So, this kind of games has unprecedented heavy load. There are so many kind of method to balance the load of MMORPG. But. many of them are not adaptable to dynamic load variation. In this paper, we propose a dynamic map-partition method based on VML. By use of dynamic map-partition based on VML, we can easily adapt to dynamic load variation. And by changing VML. we can manage field servers within game system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.71-82
• /
• 2009

As a solution to spectrum under-utilization problem, Cognitive radio (CR) introduces a dynamic spectrum access technology. In the area, one of the most important problems is how secondary users (SUs) should choose between the available channels, which means how to achieve load balancing between channels. We consider spectrum load balancing problem for CR system in frequency domain and especially in time domain. Our objective is to balance the load among the channels and balance the occupied time length of slots for a fixed channel dynamically in order to obtain a user-optimal solution. In frequency domain, we refer to Dynamic Noncooperative Scheme with Communication (DNCOOPC) used in distributed system and a distributed Dynamic Spectrum Load Balancing algorithm (DSLB) is formed based on DNCOOPC. In time domain, Spectrum Load Balancing method with QoS support is proposed based on Dynamic Feed Back theory and Hash Table (SLBDH). The performance of DSLB and SLBDH are evaluated. In frequency domain, DSLB is more efficient compared with existing Compare_And_Balance (CAB) algorithm and gets more throughput compared with Spectrum Load Balancing (SLB) algorithm. Also, DSLB is a fair scheme for all devices. In time domain, SLBDH is an efficient and precise solution compared with Spectrum Load Smoothing (SLS) method.

• Journal of Korea Game Society
• /
• v.19 no.3
• /
• pp.5-14
• /
• 2019

The gaming server is based on a distributed server. In order to distribute workloads of gaming servers, distributed gaming servers apply some algorithms which divide each of gaming server's workload into balanced workload among the gaming servers and as a result, efficiently manage response time and fusibility of server requested by the clients. In this paper, we propose a load balancing agent using PPO(Proximal Policy Optimization) which is one of the methods from a greedy algorithm and Policy Gradient which is from Reinforcement Learning. The proposed load balancing agent is compared with the previous researches based on the simulation.

• Journal of Korea Game Society
• /
• v.17 no.5
• /
• pp.103-112
• /
• 2017

In recent years, expansions and advances of the Internet of Things (IoTs) in a distributed MMOGs (massively multiplayer online games) architecture have resulted in massive growth of data in terms of server workloads. We propose a combing Sparse Autoencoder and one of platforms in MMOGs, ProGReGA. In the process of Sparse Autoencoder, data representation with respect to enhancing the feature is excluded from this set of data. In the process of load balance, the graceful degradation of ProGReGA can exploit the most relevant and less redundant feature of the data representation. We find out that the proposed algorithm have become more stable.

• Journal of Korea Game Society
• /
• v.11 no.1
• /
• pp.101-109
• /
• 2011

The performance of server becomes important issues in online game with the online game market expansion. This paper proposes a method of improving performance to decrease synchronized packets for each entity's informations in game. Our method provides adapted solution of reconstructing spatial subdivision to reduce a load of movement between boundary regions using prediction of entity's movement range and disabled regions where entity can not move to. It is shown through the experiments that proposed method outperforms existing method in terms of processing quantity of packets.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.193-198
• /
• 2006

Providing stable services has been a crucial factor to determine success or failure in current situations, in which online game industry has become one of the important industries. The study proposed a method of establishing a stable game servers using 'Hearbeat', one of the existing (load) balance server techniques for the enhancement of availability of online game servers. In the proposed method, one could provide users with stable game services, by inspecting master server frequently using stand-by servers corresponding to each game server.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.