• Journal of Korea Game Society
• /
• v.9 no.2
• /
• pp.105-113
• /
• 2009

The most important service of the online game is the stability. However, in online games, the increase in the number of users burdens the server as thousands of users connect to the server at the same time. While various techniques to reduce the load on the server are studied, the study is limited only to the server part like an improvement of server algorithms. In this paper, a program to handle the largest load of the server, the message synchronization of both the server and client, is designed and implemented.

• Annual Conference of KIPS
• /
• 2000.04a
• /
• pp.368-372
• /
• 2000

분산 객체 지향 환경에서 클라이언트/서버 시스템 구성을 위한 미들웨어는 복잡한 클라이언트/서버간의 통신을 단순화하기 위한 것으로부터 시작되어 최근에는 많은 사용자들의 다양한 요구를 해결하기 위해 보다 기능을 확장하고 있다. 이때 발생할 수 있는 문제점으로 네트웍 트래픽의 증가, 특정 웹 서버로의 집중에 따른 부하와 관리 부담의 증가 및 전체 시스템의 서비스 성능 저하를 초래할 수 있다. 이에 대한 해결 방안으로 본 논문에서는 객체 지향 분석 및 설계 방법론인 UML(Unified Modeling Language)을 이용하여 객체 지향 모델링 기법으로 Web상에서 관련된 여러 서버들간에 분산 저장된 정보를 일반 사용자에게 동적으로 빠른 서비스를 제공할 수 있고, 특정 서버에서 발생할 수 있는 오버헤드를 줄이며, 네트워크 상에서 발생할 수 있는 병목현상을 현저히 줄일 수 있도록 RDS(Remote Data Service)를 이용하는 Web 애플리케이션 설계 및 구현을 제안하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.716-719
• /
• 2003

P2P (Peer to Peer) is part that is discussed much in the latest Internet and is interested. P2P changes the structure of Client-Server into Information sharing between client that is the structure of p2p. But perfect P2P system has many problems awaiting solution. In this treatise we can realize network communication to compose one virtual server and one virtual client which is intergrated several client and distributed computer that decentralize network traffic into the traffic of several pc by sharing resource and cpu between client. Our nam purpose is not real P2P system but realization, organization of the P2P internet system which is composed by distributed computing and network load balancing in P2P internet system environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.559-561
• /
• 2002

고용량 멀티미디어 데이터의 사용 증가와 인터넷 사용 인구의 폭발적인 증가로 현재의 네트워크 인프라로는 사용자의 요구를 충분히 수용하지 못하고 있는 상황이다. 이러한 문제를 해결하기 위해 제시된 웹캐싱 기술도 캐시 서버에 부하가 집중될 때에 지속적인 서비스를 해 주는 것이 불가능한 경우가 발생한다. 본 논문에서는 여러 대의 캐시 서버를 다양한 형태의 가상 캐시 서버로 구축하여 캐시 서버 한 대에 집중되는 부하를 분산하는 방안에 대해서 연구하였다. 이를 위하여 가상 캐시 서버 시스템을 다양한 구성 방식과 알고리즘에 따라 구축하고 성능을 평가하였다. 이런 과정을 거쳐서 멀티미디어 데이터의 스트리밍 서비스에 가장 적합한 구성 및 알고리즘을 제시하였다.

• Annual Conference of KIPS
• /
• 2003.05a
• /
• pp.109-112
• /
• 2003

고성능의 웹 서비스를 지원하기 위하여 LVS 시스템을 구축하는 경우가 증가하고 있다. LVS 시스템에는 각 RealServer에 부하를 적절히 분산하여 시스템의 구성을 유지하는 부하 분배작업이 매우 중요하다. 본 논문에서는 SNMP 메시지를 사용하여 분배서버가 RealServer의 부하 상태를 획득할 수 있도록 구성하였다. 또한, 분배서버가 메모리 사용량, 부하량의 정보를 각 RealServer로부터 주기적으로 수집하고 이 정보를 바탕으로 동적 가중치를 계산한 뒤 가중치 갱신을 위한 주기 사이의 실시간 접속자 수를 부가하여 RealServer를 선정하는 동적 부하 분산 방법을 제안한다. 제안된 방법은 간단한 구성의 시스템에서 실험되었으며 잘 동작하는 것으로 확인되었다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.514-520
• /
• 2018

Presence service provides various information about users such as locations, status of on/offline and network access methods, and number of presence resources required by each users increases largely in mobile environment. Therefore an effective method which can reduce load of presence servers is needed. In this paper, a large scale distributed presence service system which can distribute effectively total presence system load of presence servers using message control session has been presented. This large scale distributed presence service system provides various presence information for massive volumes of users. In this study, a new message control session architecture which can dynamically distribute loads of the presence servers to multiple servers has been presented, and a new presence information data architecture for controlling load of the presence servers has been designed. In this architecture, each presence server can exchange current load level in real time to get variance of the total system load change according to user numbers, and can distribute system load to maintain load level of each server evenly. The performance of the proposed large scale distributed presence service system has been analysed by experiments. The results has been showed that average presence resource subscription processing time reduced from 42.6% to 73.6%, and average presence notification processing time reduced from 37.6% to 64.8%.

• Annual Conference of KIPS
• /
• 2001.10b
• /
• pp.1295-1298
• /
• 2001

멀티미디어 스트리밍 서비스를 제공하는 서버의 동적 부하분산을 위한 동적 가중치 기반 라운드 로빈 스케줄링 알고리즘을 제안한다. 기존의 가중치 기반 라운드로빈 알고리즘은 서버의 처리 용량만을 이용하여 가중치를 부여하므로 요청이 폭주할 경우 동적 부하 불균형을 갖게 된다. 동적 부하 불균형을 해결하기 위해 제안한 동적 가중치 기반 라운드로빈 알고리즘은 서버의 처리 용량뿐만 아니라 서버의 동적 부하를 이용하여 가중치를 부여하므로 동적 부하 불균형에 잘 적응하여 부하를 균형있게 조절한 수 있다. 제안한 알고리즘은 각 서버의 처리용량을 기준으로 가중치를 계산하고 동적으로 변하는 서버의 부하값에 가중치를 적용한다. 그 결과 동적 부하 불균형 문제를 해결했으며, 더 세밀한 부하 조절 기능을 수행할 수 있었다

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.224-230
• /
• 2019

In this paper, a new multiple servers conference service system using media control channel/distributed conference manipulation architecture has been presented. This conference service system can handle loads effectively from many conference participants. In this suggested architecture, media control channels are established between conference server, and distributed conference manipulation messages for distributing system loads are exchanged through this channels. These messages are transported between servers using media control channel created after stable transport sessions, and can be used to process server loads according to participants effectively. So this method can be used to implement large scale conference service system. For these purposes, formats of distributed conference manipulation messages which transmitted through media control channels are designed. and messages exchange procedures between conference servers are also presented. The performance of the proposed conference service system has been analysed by experiments, and the results show that the performances are improved according to participants.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.69-84
• /
• 2005

As the Internet users are increasing rapidly, a cluster web server system is attracted by many researchers and Internet service providers. The cluster web server has been developed to efficiently support a larger number of users as well as to provide high scalable and available system. In order to provide the high performance in the cluster web server, efficient load distribution is important, and recently many content-aware request distribution techniques have been proposed. In this paper, we propose a new content-aware load balancing technique that can evenly distribute the workload to each node in the cluster web server. The proposed technique is based on the hash histogram transformation, in which each URL entry of the web log file is hashed, and the access frequency and file size are accumulated as a histogram. Each user request is assigned into a node by mapping of (hashed value-server node) in the histogram transformation. In the proposed technique, the histogram is updated periodically and then the even distribution of user requests can be maintained continuously. In addition to the load balancing, our technique can exploit the cache effect to improve the performance. The simulation results show that the performance of our technique is quite better than that of the traditional round-robin method and we can improve the performance more than $10\%$ compared with the existing workload-aware load balancing(WARD) method.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.507-514
• /
• 2005

This paper presents a partially decentralized passive replication algorithm for deterministic servers in message-passing distributed systems. The algorithm allows any backup server, not necessarily the primary server, to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery sequence number of the request from the primary. Thanks to thus desirable feature, the algorithm with conventional load balancing techniques can efficiently avoid extreme load conditions on the primary. Therefore, it can provide better scalability of deterministic and replicated sewer systems than traditional passive replication algorithms. Simulation results indicate that the proposed algorithm can reduce $16.5\%{\~}52.3\%$ of the average response time of a client request compared with the traditional ones.