• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.603-609
• /
• 2003

Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.

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

연속 매체, 특히 비디오 데이타에 대한 일반 사용자 연산에는 재생뿐만 아니라 임의 속도 탐색 연산, 정지 연산, 그리고 그 외 다양한 연산이 있다. 이 연산 중에서 원하는 화면을 빨리 찾는 데에 유용한 고속 전진(FF: fast-forward)과 고속 후진(FB: fast-backward)은 재생 연산과는 달리 비순차적인 디스크 접근을 요구한다. 이러한 경우에 디스크 부하가 균등하지 않으면 일부 디스크에 접근이 편중되어 서비스 품질이 떨어진다. 본 논문에서는 디스크 배열을 이용한 저장 시스템에서 디스크 접근을 고르게 분산시키기 위하여 '소수 라운드 로빈(PRR: Prime Round Robin)' 방식으로 연속 매체를 디스크에 배치하는 기법에서 문제가 됐던 낭비된 디스크 저장 공간을 신뢰도 향상을 위해서 사용하는 '그룹화된 패리티를 갖는 소수 라운드 로빈(PRRgp: PRR with Grouped Parities)' 방식을 제안한다. 이 기법은 PRR 기법처럼 임의 속도 검색 연산에 있어서 디스크 배열을 구성하는 모든 디스크의 부하를 균등하게 할뿐만 아니라 낭비됐던 디스크 저장 공간에 신뢰도를 높이기 위한 패리티 정보를 저장함으로서 신뢰도를 향상시킬 수 있다. 신뢰도 모델링 방법으로 조합 모델과 마르코프 모델을 이용해서 결함발생율과 결함복구율을 고려한 신뢰도를 산출하고 비교.분석한다. PRR 기법으로 연속 매체를 저장하고 낭비되는 공간에 패리티 정보를 저장할 경우에 동시에 두 개 이상의 결함 발생 시에 그 결함으로부터 복구가 불가능하지만 PRRgp 기법에서는 약 30% 이상의경우에 대해서 동시에 두 개의 결함 발생 시에 저장한 패리티 정보를 이용한 복구가 가능할 뿐만 아니라 패리티 그룹의 수가 두 개 이상인 경우에는 두 개 이상의 결함에 대해서도 복구가 가능하다.Abstract End-user operations on continuous media (say video data) consist of arbitrary-rate search, pause, and others as well as normal-rate play. FF(fast-forward) / FB(fast-backward) among those operations are desirable to find out the scene of interest but they require non-sequential access of disks. When accesses are clustered to several disks without considering load balance, high quality services in playback may not be available. In this paper, we propose a new disk placement scheme, called PRRgp(Prime Round Robin with Grouped Parities), with enhanced reliability by using the wasted disk storage space in an old one(PRR: Prime Round Robin), in which continuous media are placed on a disk array based storage systems to distribute disk accesses uniformly. The PRRgp can not only achieve load balance of disks consisting of a disk array under arbitrary-rate search like PRR, but also improve reliability by storing parity information on the wasted disk space appropriately. We use combinatorial and Markov models to evaluate the reliability for a disk array and to analyze the results. When continuous media like PRR are placed and parity information on the wasted disk space is stored, we cannot tolerate more than two simultaneous faults. But they can be recovered by using stored parity information for about 30 percent as a whole in case of PRRgp presented in this paper. In addition, more than two faults can be tolerated in case there are more than two parity groups.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.557-565
• /
• 2000

According to CORBA specification, there are some mechanisms for object reference management such as Naming Service and Trading service, but these mechanism cant's supply all functionalities needed fomanagement in MICS. So, We have designed and implemented additional special-purpose IPO manager. It provides load balancing service based on real-time information for IPO and fault-tolerable services with the management of redundant IPOs and also provides transparent configuration of client environment with the lists of registered IPOs.

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.313-320
• /
• 2007

In this paper, we propose a method to analyze security vulnerabilities of MS word-processor by checking the validation of its input files. That is, this study is to detect some vulnerabilities in the input file of the word processor by analyzing the header information of its input file. This validation test can not be conducted by the existing software fault injection tools including Holodeck and CANVAS. The proposed method can be also applied to identify the input file vulnerabilities of Hangul and Microsoft Excel which handle a data file with a header as an input. Moreover, our method can provide a means for assessing the fault tolerance and trustworthiness of the target software.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.289-294
• /
• 2006

Checkpointing is an effective mechanism that allows a process to resume its execution that was discontinued by a system failure without having to restart from the beginning. Especially, page-level incremental checkpointing saves only the modified pages of a process to minimize the checkpointing overhead. This means that in incremental checkpointing, the time consumed for checkpointing varies according to the amount of modified pages. Thus, the efficient interval of checkpointing must be determined on run-time of the process. In this paper, we present an efficient and adaptive page-level incremental checkpointing facility that is based on the cost analysis of process execution time. In our simulation, results show that the proposed mechanism significantly reduced the average process execution time compared with existing fixed-interval-based page-level incremental checkpointing.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.131-136
• /
• 2007

Ad hoc networks enable efficient resource aggregation in decentralized manner, and are inherently scalable and fault-tolerant since they do not depend on any centralized authority. However, lack of a centralized authority prompts many security-related challenges. Moreover, the dynamic topology change in which network nodes frequently join and leave adds a further complication in designing effective and efficient security mechanism. Security services for ad hoc networks need to be provided in a scalable and fault-tolerant manner while allowing for membership change of network nodes. In this paper, we investigate distributed certification mechanisms using a threshold cryptography in a way that the functions of a CA(Certification Authority) are distributed into the network nodes themselves and certain number of nodes jointly issue public key certificates to future joining nodes. In the process, we summarize one interesting report [5] in which the recently proposed RSA-based ad hoc signature scheme, called URSA, contains unfortunate yet serious security flaws. We then propose new scheme by fixing their security flaws.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.319-328
• /
• 2000

The Message-Passing Interface(MPI) is a standard interface for parallel programming environment, based on that application programs run on the processors of a parallel computer. Processor nodes execute processes consisting the program by passing messages to one another. During executing, however, if a fault occurs on a processor node or a process, this will result an inconsistent state, and consequently, the whole program will have to be stopped. To solve this problem, in this paper, we propose a fault-tolerant message passing interface(FT-MPI) by adding a fault manager module to MPI. The proposed FT-MPI does not need any hardware support, and each application program based on MPI can run on the FT-MPI without any modification. The proposed fault tolerance scheme uses the so-called hot-spare process duplication method, and verified by simulations that application programs run despite of any fault with less than 5% overhead on execution time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.290-298
• /
• 2003

Internet-based computer systems have to provide both high-availability and high-performance. Cluster technology has been used to obtain availability and performance simultaneously Generally, high-availability cluster systems tolerate a failure of a cluster node and cost-effectively solve it. In this paper, we study availability and downtime cost of (n,k) cluster systems. By considering performance, we model state transition of (n,k) cluster systems and apply software rejuvenation technique to improve availability of the system. We find that software rejuvenation can be used to improve availability of (n,k) cluster systems.

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

최근 인터넷의 사용이 크게 증가하면서 웹을 이용한 상품 및 서비스가 크게 보급, 확산되고 있으나 상대적으로 빈약한 성능과 신뢰도를 제공한다. 클러스터링 기법은 비용 측면에서 매우 유리하며 특히 웹서비스나 정보 시스템과 같이 고성능과 고가용도를 요구하는 응용 분야에서 결함 허용 컴퓨터의 대안으로 등장하고 있다. 본 논문에서는 고가용도 및 확장성을 제공하는 클러스터링 웹 서버를 대상으로 부하 분배기의 구조를 제안하고 문서 접근 확률과 문서 크기 정보를 이용한 부하 분배 알고리즘을 개발하여 성능을 최대화할 수 있도록 하였다. 특히 제안된 알고리즘은 각 서버 노드가 동일한 운영체제로 구성되지 않아도 되고 처리 용량이 서로 달라도 되며 기존의 알고리즘에 비해 캐쉬 적중률을 향상시킨다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.847-850
• /
• 2003

이동 에이전트란 컴퓨터 네트워크 상에서 사용자를 대신하여 특정 작업을 수행하는 프로그램이 독자적으로 여러 노드들을 이동하면서 필요한 작업을 수행하고 그 결과를 사용자에게 전달하도록 작성된 프로그램을 말하며, 이런 이동 에이전트를 수행할 수 있도록 컴퓨팅 환경을 제공하는 것을 이동 에이전트 컴퓨팅 환경이라고 한다. 본 연구에서는 이동 에이전트 운영에 필수 기능인 이동 에이전트 이주 기능을 이주 시작 이전에 이주 경로를 선정하여 이주 스케줄(Itinerary)로 관리하는 기법과 이동 에이전트가 이주할 시점에서 자율적으로 이주 목적지를 선정하고 선정된 목적지의 정보를 홈에 있는 Itinerary에 저장하여 관리하는 기법을 설계하였다. 그리고 이주한 방문지에서 수행 결과를 체크포인트로 저장하여 예외나 비정상적인 종료를 하였을 때 Itinerary의 내용을 보고 성공적으로 수행한 가장 마지막 플랫폼에게 이동 에이전트의 복원 및 다른 목적지로의 이주를 요청함으로서 결함 허용(fault-tolerance) 기능을 가지도록 설계하였다.