• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.597-600
• /
• 2002

고 가용성 솔루션으로 IBM에서 내놓은 것이 HACMP이다. 이 HACMP는 두대 이상의 SYSTEM을 하나의 "cluster"로 묶어서, 각 시스템이 감시하고 있다가 한 대에 장애가 발생하면, 다른 시스템이 장애가 발생한 System의 자원을 "takeover"하는 것이다. 이 논문에서 제시하고자 하는 내용은 HACMP를 구축하는데, 쓰이는 기법 중 Mode 3의 특징들과 쓰임을 명확히 알 수 있도록 하였다. 그리고 지금현재 Mode 3 구축 기법을 이용해 HACMP를 사용중인 회사의 구축 후 장애 사례를 시스템, 네트워크 아답터, 네트워크 전체장애 별로 구분하여 나타내고 있다.체장애 별로 구분하여 나타내고 있다.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.935-948
• /
• 2003

An online scaling method adds new nodes to the shared-nothing database cluster and makes tables be reorganized while the system is running. The objective is to share the workload with many nodes and increase the capacity of cluster systems. The existing online scaling method, however, has two problems. One is the degradation of response time and transactions throughput due to the additional overheads of data transfer and replica's condidtency. The other is and inefficient recovery mechanism in which the overall scaling transaction is aborted by a fault. These problems deteriorate the availability of shared-nothing database cluster. To avoid the additional overheads throughout the scaling period, our scalingmethod consists of twophases : a parallel data transfer phase and a combination phase. The parallel data transferred datausing reduces the size of data transfer by dividing the data into the number of replicas. The combination phase combines the transferred datausing resources of spare nodes. Also, our method reduces the possibility of failure throughout the scaling period and improves the availability of the database cluster.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.841-843
• /
• 2001

인터넷의 사용자가 급증하여 고가용성과 확장성을 지닌 고성능의 인터넷 서버들이 요구된다. 클러스터 시스템은 이러한 요구사항을 만족시킬 수 있는 서버이다. 본 연구에서는 N-node heartbeat 을 구현하였고, 이것을 기반으로 하는 고가용 부하분산 클러스터, PersistentCluster를 구현하였다. PersistentCluster는 로드 벨런서가 사용자의 요구를 서버들에게 분산시켜주는 LVS 시스템에서 로드벨런서가 고장나면 나머지 서버중에 하나가 그 역할을 인계 받아 계속 수행하는 고가용성 클러스터링 솔루tus이다. PersistentCluster는 로드벨런서만 heartbeat 메시지를 전송하는 비대칭 heartbeat을 채택하여 시스템의 메시지 전송 및 처리 오버헤드를 감소시켰다. 비대칭 heartbeat을 적용할 경우에 나타나는 각 노드의 부하 감소량을 실측하며 비대칭 heartbeat 의 성 능을 평가하였다.

• 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.

• Journal of Information Technology Services
• /
• v.7 no.1
• /
• pp.195-204
• /
• 2008

As the dependency to network system and demands of efficient storage systems rapidly grows in every networking filed, the current trends initiated by explosive networked data grow due to the wide-spread of internet multimedia data and internet requires a paradigm shift from computing-centric to data-centric in storage systems. Furthermore, the new environment of file systems such as SAN(Storage Area Network) is adopted to the existing storage paradigm for providing high availability and efficient data access. We describe the design issues and system components of $SANique^{TM}$, which is the cluster file system based on SAN environment. We, especially, present the comparative results of performance analysis for the intensive I/O test by using the DBMSs that are operated at the top of cluster file system $SANique^{TM}$, EXT3 and NFS respectively.

• Convergence Security Journal
• /
• v.13 no.3
• /
• pp.17-23
• /
• 2013

Clustering is required to configure clustering interdependent structural technology. Clustering handles variable workloads or impede continuity of service to continue operating in the event of a failure. Long as high-availability clustering feature focuses on server operating systems. Active-standby state of two systems when the active server fails, all services are running on the standby server, it takes the service. This function switching or switchover is called failover. Long as high-availability clustering feature focuses on server operating systems. The cluster node that is running on multiple systems and services have to duplicate each other so you can keep track of. In the event of a node failure within a few seconds the second node, the node shall perform the duties broken. Structure for high-availability clustering efficiency should be measured. System performance of infrastructure systems performance, latency, response time, CPU load factor(CPU utilization), CPU processes on the system (system process) channels are represented.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.77-84
• /
• 2002

An cluster system used consist of large number of running servers, one has the problem that does the low availability occured by the high chance of the server failures and it is difficult to provide occuring software aging. In this paper, running cluster web servers consists of n primary servers and k backup servers, based on the operational parameters such as number of running primary servers, number of backup severs, rejuvenation period, rejuvenation time, failure rate of sewers, repair rate of servers, unstable rate of servers. We calculate to evaluate the rejuvenation policy such steady-state probabilities, downtime, availability, and downtime cost. We validate the solutions of mathematical model by experiments based on various operation parameters and find that the software rejuvenation method can be adopted as prventive fault tolerant technique for stability of system. The failure rate and unstable rate of the servers are essential factors for decision making of the rejuvenation policies.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.801-812
• /
• 2002

On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced B$^{+}$ tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply CSB$^{+}$ tree (Cache Sensitive B$^{+}$ tree) to our method instead of B$^{+}$ tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method. method.

• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.32-43
• /
• 2013

These days, there are more and more IT research institutions which foresee cloud services as the predominant IT service in the near future and there, in fact, are actual cloud services provided by some IT leading vendors. Regardless of physical location of the service and environment of the system, cloud service can provide users with storage services, usage of data and software. On the other hand, cloud service has challenges as well. Even though cloud service has its edge in terms of the extent to which the IT resource can be freely utilized regardless of the confinement of hardware, the availability is another problem to be solved. Hence, this paper is dedicated to tackle the aforementioned issues; prerequisites of cloud computing for distributed file system, open source based Hadoop distributed file system, in-memory database technology and high availability database system. Also the author tries to body out the high availability mass distributed data management architecture in cloud service's perspective using currently used distributed file system in cloud computing market.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.355-364
• /
• 2004

These days, various clustering technologies have been adopted to construct web sites. High performance hardware switches have good performance, but have disadvantage of high cost for constructing small and middle-sized web sites. Now a days, many sites have been constructed with the LVS (Linux Virtual Server), which is free of charge and has good performance. Having a centralized load balancing with one front-end, the LVS causes a bottleneck when it receives all at once. In the paper, we suggest a way to remove the LVS bottleneck by providing multiple front-ends. In this architecture, all of cluster nodes act as both a front-end and a back-end. When the load of a node receiving requests is not large enough, the node responds to the client directly. When the load of a node is large enough, the node send the request to a node which is selected by a scheduling algorithm. The scheduling algorithm is discussed to balance loads between servers. While single front-end cluster raises the throughput curvedly, the multiple front-end cluster raises the throughput linearly.