• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.875-878
• /
• 2008

Proxy MIPv6 환경에서 Local Mobility Anchor는 이동 단말에 대해 이동성을 제공하기 위한 등록과정과 데이터의 터널링을 제공한다. 다수의 Mobile Access Gateway에 위치하는 모든 이동 단말에 대해 서비스를 제공하여야 하기 때문에 Local Mobility Anchor는 병목현상을 일으킬 수 있으며 이것은 Local Mobility Anchor에 의해 관리되는 모든 이동 단말에 대해 전체적인 이동 서비스의 실패로 이어질 수 있다. 본 논문에서는 이러한 문제를 해결하기 위해 다수의 Local Mobility Anchor에 부하를 분배하며 특정한 Local Mobility Anchor에 부하가 집중될 경우 효과적으로 재분배하기 위한 기법을 소개한다. 본 논문에서 제안하는 기법을 통해 다수의 이동 단말에게 서비스를 제공하는 Proxy MIPv6 환경에서도 안정적이고 양질의 서비스를 제공하며 자원을 효율적으로 이용할 수 있을 것으로 기대된다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.183-194
• /
• 2002

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. Load balancing is considered a necessary feature for a cluster of heterogeneous workstations to minimize the turnaround time. Previously, static load balancing that assigns a predetermined weight for the processing capability of each workstation, or dynamic approaches which execute a benchmark program to get relative processing capability of each workstation were proposed. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present efficient methods for task distribution and task migration, based on the relative load index. We designed and implemented a load balancing system for the clustering environment with heterogeneous workstations. Turnaround times of our methods and the round-robin approach, as well as the load balancing method using a benchmark program, were compared. The experimental results show that our methods outperform all the other methods that we compared.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.8
• /
• pp.245-252
• /
• 2015

Recently, parallel processing methods with accelerator have been introduced into a high performance computing and a mobile computing. The photomosaic application can be parallelized by using inherent data parallelism and accelerator. In this paper, we propose a way to distribute the workload of the photomosaic application into a CPU and GPU heterogeneous computing environment. That is, the photomosaic application is parallelized using both CPU and GPU resource with the asynchronous mode of OpenCL, and then the optimal workload distribution rate is estimated by measuring the execution time with CPU-only and GPU-only distribution rates. The proposed approach is simple but very effective, and can be applied to parallelize other applications on a CPU and GPU heterogeneous computing environment. Based on the experimental results, we confirm that the performance is improved by 141% into a heterogeneous computing environment with the optimal workload distribution compared with using GPU-only method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.350-354
• /
• 2007

인터넷 사용에 따른 수많은 정보의 요청을 처리하기 위해 웹 서버 클러스터 기법에 대한 많은 연구가 진행되어 왔다. 웹 서버 클러스터 기법은 사용자들의 많은 요청을 하나의 서버에서 처리하지 않고 다수의 서버가 처리한다. 따라서 클러스터를 구성하는 다수의 서버가 클라이언트의 요청을 적절하게 분배하여, 웹 서버가 응답해야 할 부하를 분담해야 한다. 특히 금융 웹 서비스와 같은 특정 시간에 부하가 집중되는 환경에서 최소한의 클라이언트의 요청에 대한 서비스를 제공해야 한다. 이번 연구에서 DNS 기반 부하 분산 기법 및 디스패쳐 기반 부하 분산 기법을 이용한 경험적 동적 부한 분산 기법 적용을 통해 각 기법의 약점을 줄이고 부하가 급격히 증가한 시점에 전체 시스템의 성능을 떨어뜨리지 않는 기법에 대하여 논한다. 혼합 기법을 사용하기 위해 웹서버 및 디스패처의 부하 정보를 수집하고 실험을 통해 얻은 한계치를 결정한다. 그리고 이 한계치를 이용하여 부하 분산 기법을 변경함으로써 최소한의 서비스를 제공할 수 있다. 실험을 통해 제시된 부하 분산 기법이 높은 부하 상태를 보이는 시점에서 최소한의 서비스를 사용자에게 제공하여 최악의 경우를 막을 수 있음을 보인다.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.414-416
• /
• 1992

Stability analysis and load distribution problem of two coordinating robots using full dynamic model is studied in this paper. Dynamic models of two robots are combined with the position force control strategy and the Liapunov 2nd method is used for the proof of the stability. This analysis shows that the position and force control of two coordinating robot is always stable. Also, load distribution problem is mentioned with respect to the end-effector forces minimizing joint torques.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.35-47
• /
• 2006

In an Ubiquitous Environment, the growth of various services and equipment is forecasted to increase both the multicast users and diverse hacking attacks of the multicast key. Rapid increasing of multicast users and application security protocols reduce the performance of the Central key management system. Accordingly. We propose to elevate the functionality of the key management mechanism for greater efficiency and stability of the multicast services. in this paper The existing key management mechanism comparison and simulation will analyze these problems. We propose the advanced SMKD (Secure Multicast Key Distribution) mechanism application of the small group and key length control new security protocol by methods to solve these problems. The SMKD Model in this paper will help reduce loading the key distribution and encryption execution of a central key management system, and this model can also ensure stability to a central key management system by efficient key management.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.757-759
• /
• 2001

인증서의 유효성을 검사하기 위해 인증기관의 디렉도리내에 있는 최신의 인증서 폐지 목록을 많은 사용자가 동시에 조회시 시스템의 부하 및 속도 저하를 가중시킬 수 있다. 본 논문에서는 디렉토리에 대한 부하를 분산시키고 효율적으로 인증서 유효성 검사를 수행하기 위해 사용자 PC내에 자동 업데이트 엔진을 두어 인증서내의 CRL 분배점을 통한 인증서 폐지 목록을 다운로드 하는 방법을 제안하였다. 다운로드된 인증서 폐지 목록은 사용자의 인증서와 함께 유효성 검사에 이용되며 디렉토리에 대한 조회 횟수를 분산시켜부하를 감소시킬 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.945-950
• /
• 2003

The link aggregation between 10GbE switches requires an advanced frame distribution method to be properly and efficiently applied. The fixed or dynamic frame distribution methods, formerly proposed, cannot fully utilize the aggregated links, where the receiving terminal only attaches to a pre-specified link among multiple physical links. A frame distribution method using tagging is proposed for the link aggregation between 10GbE switches to solve this problem. We compared the performance of the proposed method with those of the fixed and dynamic frame distribution methods. As a result, the proposed method shows a better performance when the applied load is below 0.7 and the average length of the frames is longer than 954 bytes.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.199-210
• /
• 2008

A Clustering based wireless internet proxy server needs a layer-7 load balancer with URL hashing methods to reduce the total storage space for servers. Layer-4 load balancer located in front of server cluster is to distribute client requests to the servers with the same contents at transport layer, such as TCP or UDP, without looking at the content of the request. Layer-7 load balancer located in front of server cluster is to parse client requests in application layer and distribute them to servers based on different types of request contents. Layer 7 load balancer allows servers to have different contents in an exclusive way so that it can minimize the total storage space for servers and improve overall cluster performance. However, its scalability is limited due to the high overhead of parsing requests in application layer as different from layer-4 load balancer. In order to overcome its scalability limitation, in this paper, we propose a distributed layer-7 load balancer by replacing a single layer-7 load balancer in the conventional scheme by a single layer-4 load balancer located in front of server cluster and a set of layer-7 load balancers located at server cluster. In a clustering based wireless internet proxy server, we implemented the conventional scheme by using KTCPVS(Kernel TCP Virtual Server), a linux based layer-7 load balancer. Also, we implemented the proposed scheme by using IPVS(IP Virtual Server), a linux-based layer-4 load balancer, installing KTCPVS in each server, and making them work together. We performed experiments using 16 PCs. Experimental results show scalability and high performance of the proposed scheme, as the number of servers grows, compared to the conventional scheme.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.115-122
• /
• 2002

This paper presents a new web cluster scheme based on dispatcher which does not depend on operating system for server and can examine server's status interactively. Two principal functions are proposed for new web cluster technique. The one is self-controlled load distribution and the other is transaction fail-safe. Self-controlled load distribution function checks response time and status of servers periodically, then it decides where the traffic goes to guarantee rapid response for every query. Transaction fail-safe function can recover lost queries including broken transaction immediately from server errors. Proposed new web cluster scheme is implemented by C language on Unix operating system and compared with legacy web cluster products. On the comparison with broadcast based web cluster, proposed new web cluster results higher performance as more traffic comes. And on the comparison with a round-robin DNS based web cluster, it results similar performance at the case of traffic processing. But when the situation of one server crashed, proposed web cluster processed traffics more reliably without lost queries. So, new web cluster scheme Proposed on this dissertation can give alternative plan about highly increasing traffics and server load due to heavy traffics to build more reliable and utilized services.