• Journal of Korea Multimedia Society
• /
• v.9 no.6
• /
• pp.742-749
• /
• 2006

In the network-based game where it uses the Internet infrastructure, the implementation is possible with the various methods. Such Applications are developed in the multi-tired architecture. There are many cases for the server to be separated from the hardware or the software. In this case, a lot of applications make the distributed process possible and are made as the multi-tiered architecture to develop the reusability of the existing software module. Especially, it is mostly general to separate for the case of a database server to a new tier. One of the important points of multi-tiered server side applications is security and because of this, it is difficult to share the related data about the design skill. Using design patterns, it gives help in reusing the existing written-code for the design of the game that needs a lot of money and time. Design Patterns are related to the software reuse. For the development of more efficient games, if well-defined design patterns are provided to the developers, then it would make more easy advanced game API and make possible the framework for the game development based on the API Through the analysis of the general network-based game currently servicing in the Internet, in this paper, we discuss how to implement a business logic tier using database system among the server side architectures. The main objective of this article is to show an efficient APIs(Application Programming Interfaces) design method which can be used to manage the data that must be saved to the database system among the packets that client/server have to be exchange.

• Journal of Korea Game Society
• /
• v.16 no.4
• /
• pp.57-68
• /
• 2016

As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.01a
• /
• pp.69-70
• /
• 2022

본 논문에서는 Photon Network를 사용하여 경찰과 도둑 컨셉으로 5명이 함께 즐길 수 있는 Multi Game을 구현하였다. 서버는 리슨 서버 방식으로 Master Client가 게임을 시작하면 Game에 참가한 모든 Player는 Photon Network의 RPC 기능을 사용하여 Player의 동작, Game 진행 상황 등을 실시간으로 Server에 동기화한다.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.185-194
• /
• 2005

A Server-Proxies-Users communication system is studied by using Stackelberg strategy theory of game. A new model, in which the server, proxies and users are not equal is established, and that is a three-level programming. The solution existence of the model is proved.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.863-868
• /
• 2002

In this paper we suggested a map management method for on line RPG supporting full 3D. In general, it is possible to support full 3D with client engine. Rut the online game server cannot show the expected performance under normal price constrains with current hardware technology, since the amount of data for management of 3D on-line game server increase exponentially with respect to the size of game world. To solve this problem. we introduced the "special object" which makes it possible for on-line game server with low performance hardware. This suggested method gave concrete from to manage full 3D for server as well as clients.s clients.

• Journal of Korea Game Society
• /
• v.17 no.6
• /
• pp.165-172
• /
• 2017

Some duplicate processes are happen in developing games under the diverse platforms. Implementing functions. like processing and managing data, in every platforms have an influence on game development. In this paper, we propose a multi-platform server framework that can simulate combat games such as one server on any platform. It was designed to be easy to debug using a protocol consisting of attribute-value pairs by the JSON data format. Since it is independent of the programming language, it has the advantage of being able to communicate with various languages. The server proposes a model that can easily upgrade the structure or the specification using the Amazon web server.

• Journal of Korea Game Society
• /
• v.10 no.3
• /
• pp.83-92
• /
• 2010

The command that game users give should be reflected to the game immediately and should be transferred to several objects at once. Also, all game users who participate in game should keep the same progress situation in Real-Time Strategy game. But it takes a certain amount of time to get the command pass to other users, and it is important issue that many commands are synchronized in a short amount of time on server of RTS game. Therefore we propose a scheme for an efficient synchronization based on event locking method on RTS game in this paper. We design and implement the gaming server applying to our proposed scheme. Also, we show efficiency of our proposed scheme by performance analysis in this paper.

• Journal of Korea Game Society
• /
• v.16 no.3
• /
• pp.97-108
• /
• 2016

Multi-client online games usually employ multi-serve architectures. For group play, if the user response time deviation between the clients in a group is large, the fairness and attractions of the game will be degraded. In this paper, given new clients, we propose a method for assigning the clients to servers to minimize the deviation of client-server distance which plays a major role in the user response time. This method also supports client matching for group play and server load balancing. We formulate the client-server assignment problem as an IP one, and present a GA(Genetic Algorithm)-based algorithm to solve it. We experimented our method under various settings and analyzed its features. To our survey, little research has been previously performed on client-server assignment under consideration of client matching, distance deviation minimization and server load balancing.

• Journal of Korea Game Society
• /
• v.17 no.4
• /
• pp.137-148
• /
• 2017

Since the power consumption of data centers is large and computer serves take a large portion of it, there have been much research on the power saving of servers in various ways recently. Among the units of severs CPU is one of major power consuming units. In this paper, a method of client-server assignment for minimizing the CPU power consumption of servers in a game server cluster is proposed. We model the client-server assignment problem as an optimization problem, and find a solution to the problem using a simulated annealing-based technique. One of major features of our method is to select a proper operating frequency according to the amount of load on a server. The selection of a lower frequency in case of low load will result in reducing power consumption. To our survey, little research on client-server assignment in consideration of power consumption has been carried out.

• 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.