• The Journal of the Korea Contents Association
• /
• v.7 no.11
• /
• pp.69-75
• /
• 2007

In this paper, we propose a new distributed processing scheme to support MMORPG (Massively Multiplayer Online Role-Playing Games). But existing distributed game servers have some problems such as hotspot, congestion, server failure problems, and so on. To solve such problems, our proposed scheme begins by splitting the large virtual world into smaller regions, each region handled by a different server. We present a scheme that reduces the bandwidth requirements for both game servers and clients. Also our scheme allows seamless interaction among players residing on areas handled by different servers. We show an excellence of the proposed solution through various experiments.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.44-49
• /
• 2016

Recently, data has been growing dramatically along with the growth of social media and digital devices. A distributed memory processing system has been used to efficiently process large amounts of data. However, if a load is concentrated in a certain node in distributed environments, a node performance significantly degrades. In this paper, we propose a load balancing scheme to distribute load in a distributed memory environment. The proposed scheme replicates hot data to multiple nodes for managing a node's load and migrates the data by considering the load of the nodes when nodes are added or removed. The client reduces the number of accesses to the central server by directly accessing the data node through the metadata information of the hot data. In order to show the superiority of the proposed scheme, we compare it with the existing load balancing scheme through performance evaluation.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.45-52
• /
• 2006

To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.135-144
• /
• 2012

All the servers in a traditional server cluster environment are kept On. If the request load reaches to the maximum, we exploit its maximum possible performance, otherwise, we exploit only some portion of maximum possible performance so that the efficiency of server power consumption becomes low. We can improve the efficiency of power consumption by controlling power mode of servers according to load situation, that is, by making On only minimum number of servers needed to handle current load while making Off the remaining servers. In the existing power mode control method, they used a static policy to decide server power mode at a fixed time interval so that it cannot adapt well to the dynamically changing load situation. In order to improve the existing method, we propose a dynamic server power control algorithm. In the proposed method, we keep the history of server power consumption and, based on it, predict whether power consumption increases in the near future. Based on this prediction, we dynamically change the time interval to decide server power mode. We performed experiments with a cluster of 30 PCs. Experimental results show that our proposed method keeps the same performance while reducing 29% of power consumption compared to the existing method. In addition, our proposed method allows to increase the average CPU utilization by 66%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.385-387
• /
• 2011

본 논문은 철강 공정을 위한 로그서버의 구조를 설계하였다. 제안된 로그서버는 기존에 개발된 철강공정용 레벨 2 표준 미들웨어인 POSMOS 미들웨어의 특정 Agent 기능을 활용하여 독립적으로 구현됨으로써, 로그 활용을 위한 시스템 부하를 줄이고, 분산환경 아래에서의 통합적인 로그 수집이 가능하도록 설계 되었다. 본 로그 서버를 통한 로그 관리는 무정지 환경 아래의 철강 공정의 시스템의 안정성 확보를 위해 활용될 예정이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.91-93
• /
• 2004

인터넷의 정보가 많아짐에 따라 인터넷에서 원하는 정보를 얻어 효과적으로 사용하기는 더욱 힘들어지고 있다. 그러므로 관련된 정보에 쉽게 접근하기 위해 얻고자 하는 정보를 인터넷에서 자동적으로 전달해 주는 푸쉬 기술은 중요한 인터넷 기술로 주목받고 있다. 하지만 푸쉬 기술은 정보 전달 방식으로 인해 네트웍 대역폭을 너무 많이 소요하기 때문에 푸쉬 서버의 가용성이 급격히 떨어질 수 있다는 단점을 가지고 있다. 따라서 본 논문에서는 메시지 폭주로 인한 시스템 고장에 대처하고 부하를 분산시킬 수 있는 복제에 기반한 푸쉬 서버를 설계하고, Erlang/OTP로 구현하였다. 성능을 분석하기 위하여 단일 푸쉬 서버론 사용한 결과와 본 논문에서 제안된 구조를 사용한 결과론 비교.분석하였다.

• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.559-565
• /
• 2011

In this paper, I propose a distributed game server system which has flexibility of enormous game character's processing in MMORPG using block scheme. I proposed game servers in distributed system grouped with zone which charge of each map, and the game servers in this zone divide game map into several unit blocks and process distributing blocks to game servers according to its performance. I proposed distributed game server system using block scheme can add/drop game map to/from easily through block process method in game and communication servers. Therefore, my proposed system can enormous character processing and add user created game map to existed game map easily in the future as well. Also, my scheme increases the system utilization and upgrades system stability by dynamic distribution of game map according to the number of characters and performance of servers.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3479-3489
• /
• 2000

Most of the study on fairness control method for Distributed-Queue Dual-Bus(DQDB) have been performed under specific load types such as equal probability load types or symmetric load types. On Web-based internet enviroments client-server load types are more practical traffic patlerns than specrfic load types. In this paper, an effiective fairness control method to distribute DQDR network bandwidth fairly to all stations under a client-server load is proposed. In order to implement a dynamic bandwidth timing capabihty needed to distribute the bandwidth fairty at heavy loads, the proposed method uses two pararnetexs, one is an access hrnit to legulate each station's packet transmission and the other is the number of extra emply slots that are yielded to downstream stations. In point of implementation this mechanism is simpler and easier than Bandwidth Tuning Mechanism(BTM) that uses an intermediate pattern and an adptation function. Simulation results show that it outperforms othen mecharusms.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.11-18
• /
• 2011

The increasing of web users load to the excessive transmission traffic and system overload problems. To solve these problems, cluster systems are studied. In conventional cluster systems, when the request size is large owing to such types as multimedia and CGI, the particular server load and response time tend to increase even if the overall loads are distributed evenly. In this paper, we consider the methodology of efficient resource usage, specially distributed web cluster system. We develope an algorithm that distributes the load on the web cluster system to use the system resources, such as system memory equally. The response time is chosen as a performance measure on the various clustering models. And based on the concurrent user to the web cluster system, the response time is also examined as the number of users increases. Simulation experience with this algorithm shows that the response time and average throughput seems to have a good results compare to those with the other algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.846-853
• /
• 2004

This paper introduces implementation of a traffic distributed processing system on the Web Sever Networking. The study used two software packages （Packet Capture and Round-Robin Test Package） to check packet quantity from Virtual Network Structure (data generator, virtual server, Serve. 1, 2, 3), and could find out traffic distribution toward Server 1, 2, and 3. The functions of implemented Round-Robin Load Balancing Monitoring System include Round-Robin testing, system monitoring, and graphical indication of data transmission/packet quantity (figures ＆ diagram). As the result of the study shows, Round-Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some cases, they were eventually alleviated by repeated tests for a long period of time.