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

개인 통신 서비스에서 주된 당면 문제중의 하나는 위치를 자주 이동하는 많은 이동 단말기들의 위치를 찾는 것이다. 위치 관리를 성취하기 위하여 많은 네트워크 신호처리 트래픽과 데이터베이스 질의가 요구된다. 다수의 정책들은 이동 단말기의 현재 위치를 저장하기 위하여 위치 레지스터 데이터베이스를 사용하고, 그 위치 레지스터의 고장에 대해 약점을 가지고 있다. 이 논문에서, 우리는 위치 레지스터들의 고장을 포용하는 분산 홈 위치 레지스터를 갖는 결함 포용 전방 포인터 방법을 제안한다. 제안하는 방법의 성공을 분석적 모델로 평가하고, Biaz의 우회 전방 정책, 두개 경로 전방 정책과 성능을 비교한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.19-22
• /
• 2003

현대 사회는 인터넷과 네트워크의 발전과 더불어 많은 성장을 거듭해 왔고, 인터넷을 이용한 많은 서비스들은 계속해서 생기고 있다. 이러한 사회적인 배경에서 인터넷을 이용한 서비스에 대한 의존도도 또한 급격하게 증가하고 있다. 서비스를 언제, 어디서나 접근이 가능하게 함으로써 사용자들이 편리한 서비스를 제공받을 수 있게 되었지만, 이러한 서비스들이 안정적으로 제공되어야 한다. 고로 본 논문에서는 컴퓨터 시스템에 대한 신뢰성을 확보하기 위해 사용되는 기법 중 소프트웨어적인 고장 감내 시스템에 대해 알아보고 그에 따른 기법들을 조사하여 단일 시스템에서 구현해 볼 수 있는 방법 중 감시 프로세스를 이용하여 서비스를 안정적으로 서비스를 할 수 있는지에 대해 알아보았다.

• Proceedings of the Korean Reliability Society Conference
• /
• 2005.06a
• /
• pp.295-301
• /
• 2005

It is not easy to apply fault-tolerant techniques which are used in conventional computer systems successfully to the field of embedded computing system directly. In this paper, we study on the way of minimizing hardware and/or software backups for vehicle embedded computing systems. First, we group parts that constitute vehicle embedded systems and next feature subset is determined using the grouping information derived. The possibility of implementing graceful degradation capability in vehicle embedded systems is verified.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.2
• /
• pp.21-28
• /
• 2002

This paper proposes a new approach to rollback-recovery using multi-agent in distributed computing system. Previous rollback-recovery protocols are dependent on inherent communication and operating system, which causes a decline of computing performance in distributed computing system. By using multi-agent, we propose rollback-recovery protocol that is independent on operating system. We define three kinds of agent. One is a recovery agent that performs rollback-recovery protocol after a failure. Other is an information agent that constructs domain knowledge as a rule of fault tolerance and information during failure-free operation. The other is facilitator agent that controls the efficient communication between agents. Also we propose rollback-recovery protocol using multi-agent and simulated the proposed rollback-recovery protocol using JAVA and agent communication language in CORBA environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.1009-1023
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k ) 그래프 이론적 관점에서 고찰하고 정점이 서로소인 경로에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )의 서로 다른 두 노드 v와 w를 잇는 연결도 kappa(G)개의 서로소인 경로의 길이가 두 노드 사이의 거리d(v,w)나 혹은 G(2^m , 2^k )의 지름 \dia(G)에 비해서 얼마나 늘어나는지를 고려한다. 서로소인 경로를 재귀적으로 설계하는데, 그 길이는 k ge2일 때 d(v,w)+2^k-1과 \dia(G)+2^k-1의 최솟값 이하이고, k=1일 때 d(v,w)+3과 \dia(G)\+2의 최솟값 이하이다. 이 연구는 (2^m , 2^k )의 고장 감내 라우팅, 고장 지름이나 persistence의 분석에 이용할 수 있다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties concerned with node-disjoint paths. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . We consider the length increments of {{{{kappa(G)disjoint paths joining arbitrary two nodes v and win G(2^m , 2^k )compared with distance d(v,w)between the two nodes and diameter {{{{\dia(G)of G(2^m , 2^k ), where kappa(G)is the connectivity of G(2^m , 2^k ). We recursively construct disjoint paths of length less than or equal to the minimum of {{{{d(v,w)+2^k-1and \dia(G)+2^k-1for kge2 and the minimum of d(v,w)+3 and \dia(G)+2for k=1. This work can be applied to fault-tolerant routing and analysis of fault diameter and persistence of G(2^m , 2^k )

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.1
• /
• pp.1-13
• /
• 2002

In Distributed Batch-processing Systems (DBSs), CPU-intensive jobs are automatically transferred and executed using idle computers across a network, there by increasing the resource usage and throughput. To be successful, the systems must guarantee the scalablility, fault-tolerance, and flexibility of dynamic configurations. In practice, however, it is very difficult to provide such capabilities in a non-deterministic environment in which the available set of resources is unpredictable because of network failures, computer failures, or voluntary withdrawal from a pool by a machine owner. In this paper, we present the design and implementation of the J-JDBS (Jini-based Java Distributed Batch-processing System) system which is based on the core Jini services like Discovery service, Lookup service, Lease service and etc. We show that the Jini core services can be very effectively used to build reliable, scalallle, fault-tolerant, and flexible DBS systems with little effort.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12C
• /
• pp.1123-1130
• /
• 2009

The advances in networking technology and importance of multimedia communication require real time transaction. In many applications, high reliable real-time communications are required more frequently. In this paper, we propose a reliable communication in cube-based multi -computer using the safety vector. Each node in a cube-based n dimensional multi-computer is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. We propose an algorithm that can establish detour paths using the safety vector. The established detour paths are disjoint with the primary real-time channel. Therefore, our algorithm is more efficient than earlier proposed algorithms.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.2
• /
• pp.227-234
• /
• 2002

An cluster web server system, one has the problem that does the low availability occured by the high chance of the server failures and it is not easy to provide high performance and availability occuring software aging. In this paper, running cluster web sewers consists of n primary servers and k backup servers, propose software rejuvenation model on performance and switchover time. Based on the various system operational parameters, we calculate to evaluate the rejuvenation policy such steady-state probabilities, availability, and downtime cost. And we validate the solutions of mathematical model by experiments based on various operation parameters and fud that the software rejuvenation method can be adopted as prventive fault tolerant technique for stability of system.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.330-338
• /
• 2006

Many web cache systems and policies concerning them have been proposed. These studies, however, consider large objects less useful than small objects in terms of performance, and evict them as soon as possible. Even if this approach increases the hit rate, the byte hit rate decreases and the connections occurring over congested links to outside networks waste more bandwidth in obtaining large objects. This paper puts forth a client-cluster approach for improving the web cache system. The client-cluster is composed of the residual resources of clients and utilizes them as exclusive storage for large objects. This proposed system achieves not only a high hit rate but also a high byte hit rate, while reducing outgoing traffic. The distributed hash table (DHT) based peer-to-peer lookup protocol is utilized to manage the client-cluster. With the natural characteristics of this protocol, the proposed system with the client-cluster is self-organizing, fault-tolerant, well-balanced, and scalable. Additionally, the large objects are managed with an index based allocation method, which balances the loads of all clients well. The performance of the cache system is examined via a trace driven simulation and an effective enhancement of the proxy cache performance is demonstrated.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.559-566
• /
• 2005

ALTIBASE is the relational main memory DBMS that enables us to develop the high performance and fault tolerant applications. It guarantees the short and predictable execution time as well as the basic functionality of conventional disk-based DBMS. We present the overview of system architecture and the performance analysis with respect to the various design choices. The assorted experiments are performed under the various environments. The results of TPC-H and Wisconsin benchmark tests are described. We illustrate the various performance comparisons under the various index mechanisms, the replication models, the transaction durabilities, and the application structures. A performance study shows the ALTIBASE system can be applied to the wide area of industrial DBMS fields.