• Journal of the Korean Data and Information Science Society
• /
• v.20 no.3
• /
• pp.467-474
• /
• 2009

There are many situations arising in reliability engineering and biomedical science where failure of a subsystem increases the failure rate of other subsystem under shared load models. In this paper, the maximum likelihood estimates and the modified maximum likelihood estimates of mean time to failure and reliability function for shared load model with guarantee time are obtained by using censored system life data. Some illustrative examples are included.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1097-1106
• /
• 2004

The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1064-1072
• /
• 1999

The well-known Dimension Exchange Method(DEM) to quantized loads may result in difference in assigned loads to processors as large as logn~units, in the worst case, after balancing for a hypercube of size n. In order to limit the increase of the accumulation of these differences, this paper proposes a method that limits the accumulation of the difference by redistributing an unit load (odd or even) of the same type, if possible, when there is a load distribution between two processors. We reduced the maximum difference to LCEIL logn over {2} RCEIL . The result shows the simulation experiments which show about 30% improvement in speedup compare to the DEM.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.466-472
• /
• 2002

We investigate the load sharing problem between the umbrella cell and the overlaid tells in hierarchical cell structure. A load sharing strategy is proposed and its performance is evaluated by simulation when it is used for transmission of the mobile Internet traffic using the High Speed Downlink Packet Access scheme. The results show that, with the proposed strategy, the microcell backs well the overlaid picocells up, especially when a specific picocell cluster suffers unusual heavy load condition. By using the strategy, we can reduce the installation cost, otherwise needed for increasing the system capacity of every picocell cluster to cope with the unusual heavy load.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.60-67
• /
• 2005

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. Content-based load distribution for web server clusters uses the detailed data found in the application layer to intelligently route user requests among web servers. In this paper, we propose a content-based load distribution algorithm that considers cache hit and load information of the web servers under the web server clusters. In addition, we expand this algorithm in order to manage user requests for dynamic file. Specially, our algorithm does not keep track of any frequency of access information or try to model the contents of the caches of the web servers.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.109-112
• /
• 2003

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

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.285-294
• /
• 2003

The request scheduling algorithms being used for the cluster web servers are mostly in two categories : load-balancing and contents-based cache affinity The goal of the load-balancing algorithms is to balance the loads between real servers. On the other hand, contents-based scheduling algorithm exploits the cache affinity in a way that the same type of requests are to be directed to a dedicated real server allowing load imbalance. So the performance comparison of the two algorithms is necessary, nevertheless the related experiment results are not much suggested. In this paper, performance evaluations have been done to compare the performance of the two scheduling algorithms. To accomplish this, we first implement a linux cluster web server, and then present the performance measurement results. The main contribution of this paper is to help the cluster web server administrators to select an algorithm fitting in with their circumstances from the two algorithms.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.299-310
• /
• 2001

In this paper, we study the methodology of distributing the requests of clients based on the state of real server in the LVS(Linux virtual server) clustering system. The WLC(weighted least connection) algorithm in the LVS cluster system is studied. The load distributing algorithm which assigns a weight into each real server is devised by considering the load of real servers. The load test is executed to estimate the load of real servers using a load generating tool. Throughout the result of the experiment, we suggest new load distributing algorithm based on the usage of physical memory of each real server. It is shown that the correction potentiality of new algorithm is somewhat better than that of the WLC algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1341-1344
• /
• 2002

클러스터링을 이용한 웹 서버 구축 시 각 노드에 적절한 부하 분산이 이루어지도록 하는 것은 매우 중요하다. 부하 분배 알고리즘은 서버의 성능에 많은 영향을 미치며 부하 분배에 이용되는 기준은 간단하고 빨리 계산될 수 있어야 한다. 본 논문에서는 고가용도 및 확장성을 제공하는 클러스터링 웹 서비스를 대상으로 문서 접근 확률과 문서 크기 정보를 이용하는 동시에 캐쉬 적중률을 향상시키는 알고리즘을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.53-55
• /
• 2000

인터넷의 급성장은 웹서버의 요청율을 급격하게 증가시키고 심각한 정체를 일으키고 있다. 이를 해결하기 위하여 클라이언트의 요청을 분산된 여러 서버들에게로 전달시키는 방법이 많이 사용되고 있다. 이 방법은 웹서버의 처리량을 향상시키고 확장성과 가용성을 제공하지만 서버들의 부하를 균등하게 하는 방법이 필요하게 된다. 이러한 부하 균등을 위해 크게 DNS(Domain Name Server)를 활용한 정책과 IP 단계에서 분배기(Dispatcher)를 사용한 정책이 제안되었다. 본 논문에서는 전자와 후자의 단점을 보완하고 성능을 향상시킨 다중 분배기를 제안하고 실험하였다.