• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.63-71
• /
• 2014

In this paper we researched on the Duplication Techniques for Active-Active Web Servers. Rsync and crontab utilities make copy periodically between web servers and maintain the same status. Load Balancing Server makes web servers load balanced and fast servicing by executing web servers alternatively. Even though one web server stops due to some critical errors, the remaining web server can take over and provide services continuously.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.550-558
• /
• 2001

Although the web is becoming a widely accepted medium, it provides relatively poor performance and low availability. A cluster consists of a collection of interconnected stand-alone computers working together and provides a high-availability solution in application area such as web services or information systems. In this paper, we propose a load balancer architecture under the web server cluster that provides high-availability, high performance and scalability. In addtion, we propose an efficient load balancing algorithm that considers access rate and size of documents. Specially, our algorithm does not require the nodes running under similar configurations and the same operating system. Also, server cache can be utilized more efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.168-174
• /
• 2007

All of users who connect to mobile game want to play seamless real-time game without any loads on game servers. However, as for existing methods, it is not available to effectively distribute server loads. Therefore, in this paper, we design and implement an uniform variance-based load balancer for distributing loads of game servers for wireless online games by suitable load balancing methods. With this methods, we can deal with dynamically increasing game servers as the information about load balancing of specific period is applied to the administrator.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.381-384
• /
• 2002

This paper describes the motivation, design and performance of bi-active Load balancer in Linux Virtual Server. The goal of bi-active Load balancer is to provide a framework to build highly scalable, fault-tolerant services using a large cluster of commodity servers. The TCP/IP stack of Linux Kernel is extended to support three IP load balancing techniques, which can make parallel services of different kinds of server clusters to appear as a service on a single IP address. Scalability is achieved by transparently adding or removing a node in the cluster. and high availability is provided by detecting node or daemon failures and reconfiguring the system appropriately. Extensive simulation reveals that the proposed approach improves the reply rate about 20% compared to earlier design.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1661-1664
• /
• 2003

The transcoding is a method which converts a multimedia stream to an adaptive format, such as frame rate and resolution, that can be played in the mobile devices. Due to the heavy consumption of CPU power for transcoding, the server in charge cannot supply all streams requested from clients if it is already occupied by several streams. The load balancing among proxies is a common approach for solving such problem. In addition to collaborative works for load balancing, the mobility must be taken into account in the mobile environments. Thus, the wired-network based algorithm is not suitable for the streams service in the mobile environments. In this paper, we propose an alternative scheme for cooperative proxy architecture that considers the case in which mobile devices are moving over other zones.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.187-190
• /
• 2000

전형적인 멀티미디어 시스템은 클라이언트-서버 구조로 이루어지고 있다. 사용자의 요청에 따라 요청된 데이터를 갖고 있는 적절한 서버를 찾는 방법을 확장성 있게 지원하기 위해 계층적 관리 구조가 제시되었다. 이 접근방법에서는 중간 계층에서 영역 관리자가 사용자의 요청을 전달해 줌으로 인해서, 사용자 요청에 대한 거부 확률을 효과적으로 줄일 수 있다. 그러나 load balancing 을 이루기 위한 계층적 관리 구조에서는 정적 복제 방식을 사용함으로 인해서 사용자 요청에 대한 거부 확률이 최소화되지 못하였다. 따라서, 본 연구에서는 계층적 관리구조에 멀티미디어 데이터가 요청되는 패턴에 따라 동적으로 변화하는 동적 복제 방식을 도입할 것을 제안하고, 실험을 통하여 제안된 방법은 기존의 방법과 비교하였다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.67-73
• /
• 2010

A Wireless Sensor Network(WSN) is a promising infrastructure for the future U-healthcare system. In a WSN for the U-healthcare system, both biometric data and location data are transferred hierarchically from lots of mobile patients to the base station server and some countermeasures are made in real time if necessary. In this process, we encounter the load-balancing problem when many patients gather in a specific area. We also encounter the data duplication problem when each patient moves into an area monitored by several supervisors. The second problem is closely related to the first one. In this paper, we propose a mobile patient monitoring system with priority-based policy in load-balancing to solve the previous two problems and perform a DEVS Java-based system simulation to verify the system efficiency.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.327-332
• /
• 2007

An engineering design problem involving Multi-Disciplinary Analysis(MDA) generally requires a large amounts of CPU time for the entire design process, and therefore Multiple Processing System (MPS) are essential to reduce the completion time. However, when applying conventional parallel processing techniques, all of the CAE S/W required for the MDA should be installed on all the servers making up NIPS because of characteristic of MDA and it would be a great expense in CAE S/W licenses. To solve this problem, we propose a Weight-based Multiqueue Load Balancing algorithm for a heterogeneous MPS where performance of servers and CAE S/W installed on each server are different of each other. To validate the performance, a computational experiments comparing the First Come First Serve algorithm and our proposed algorithm was accomplished.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.709-718
• /
• 2002

Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3179-3189
• /
• 1999

In this paper, different methods of integrating heterogeneous network information systems into the Web are observed by comparing a cliented Java CGI model with a server-oriented CGI model. In addition, a load balanced(LB, for short) CGI model is proposed, which combines two models and decides its course of action depending on the load state of the web server, and compared with the other two models. Performance evaluation models for three models are also presented. The results of computer simulations indicate that the LB CGI model performs consistently well irrespective of system load or server performance.