• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.4
• /
• pp.11-17
• /
• 1996

In the case of redundancy control performed by a netowrk management system, it can not be ignored some delay of control time and break of control by failure of the system. This paper proposed a new method to improve the performacne of a redundancy control system interfaced to the network management system. At first, it produced the modelling of the total system and analyzed the functional relation of reliability and failure rate for a transmission system having an one-to-one active redundancy structure controlled by itself. After describing the loss rate of transmission data and the time required for the redundancy control process of the network management system when a failure is occurred, it proposed the new redundancy method of complex system control mode as an effective redundancy control method to improve reliability of a redundancy control system. Finally, it proved the effect by comparing the new result to the previous result.

• Journal of the Korea Society for Simulation
• /
• v.11 no.3
• /
• pp.49-58
• /
• 2002

It takes 2 or 3 months to manufacture memory device. Defect has to exist owing to hundreds of processes. If there are too many defects, the memory has to be rejected. But if there are a few defects, it will be more efficient and cost reducing for the company to use it by repairing. Therefore, laser-repair process is needed for such a reason and redundancy analysis is needed to establish correct target of laser-repair process. The equipment development company had provided the redundancy analysis and each development company had developed and provided separately. So, to analyze the similar type of defects, redundancy analysis time can be very different by the manufacture. The purpose of this research is to strengthen the competitive price and to apply correlation concept in business for reducing the redundancy analysis time to repair the defects

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.05a
• /
• pp.151-155
• /
• 2002

Memory의 공정기간은 2∼3개월 정도, 공정은 수백가지에 이를 정도로 많기에 defect은 존재할 수밖에 없다. 많은 defect이 있다면 어쩔 수 없겠지만 적은 defect이 발생한 경우에는 해당 die를 reject시키는 것보다는 repair해서 사용하는 것이 memory생산 업체 입장에서는 보다 효율적이고 원가 절감 차원에서 필수적이다. 이와 같은 이유로 laser repair라는 공정이 필요하고 laser repair공정의 정확한 target을 설정하기 위해 redundancy analysis가 필요하게 되었다. 지금까지 redundancy analysis는 장비 개발 업체에서 제공하는 경우가 대부분 이었고 각 장비 제조 업체별로 redundancy analysis algorithm을 개발하여 제공하여왔기에 동일한 defect 유형에 분석하는 redundancy analysis time이 각 장비 업체 별로 다른 경우가 대부분이었다. 이에 본 연구에서는 기존의 redundancy analysis algorithm의 개념에서 벗어나 defect 유형별로 simulation한 후 redundancy analysis를 진행함으로써 redundancy analysis에 소요되는 시간을 절약함으로써 원가 경쟁력 강화를 하고 correlation 개념을 업무에 적용하는데 목적이 있다

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.9 no.14
• /
• pp.45-48
• /
• 1986

This paper studies reliability growth model in redundancy allocation of Parallel-series system in which several series system is linked parallelly, The model is generalized by system redundancy of sub-system that have components redundancy. The stage of components in each sub-system is established differently. At the same time by assigned the different number of constraints to the sub-system, this paper deals with rather practical reliability growth model.

• Proceedings of the KSR Conference
• /
• 2006.11b
• /
• pp.1198-1202
• /
• 2006

MTBF(Mean Time Between Failure)와 MTBSF(Mean Time Between Service Failure) are two representative quantitative reliability requirements for railway systems. There are the case that both of the two requirements are presented and the case that only one of them is presented in the specification of railway systems. we deal with the redundancy allocation problem to meet the two reliability requirements. The redundancy increases MTBSF while it decreases MTBF. Parallel redundancy and the exponential lifetime distribution of components are considered for the series systems. Mathematical model and example are presented for the redundancy optimization problem of minimizing the cost subjecting to MTBF and MTBSF requirements.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.131-136
• /
• 1990

In this paper, new methods are proposed which speed up the logical redundancy identification for the gate-level logic optimization. Redundancy indentification, as well as deterministic test pattern generation, can be viewed as a finite space search problem, of which execution time depends on the size of the search space. For the purpose of efficient search, we propose dynamic head line and mandatory assignment. Dynamic head lines are changed dynamically in the process of the redundancy identification. Mandatory assignement can avoid unnecessary assignment. They can reduce the search size efficiently. Especially they can be used even though the circuit is modified in the optimization procedure, that is different from the test pattern generation methods. Some experimental results are presented indicating that the proposed methods are faster than existing methods.

• Journal of Applied Reliability
• /
• v.1 no.1
• /
• pp.1-8
• /
• 2001

Redundancy allocation problems have been considered at single-level systems and it may be the best policy in some specific situations, but not in general. With regards to reliability, it is most effective to allocate the lowest objects, because parallel-series systems are more reliable than series-parallel systems. However, the smaller and lower in the system an object is, the more time and accuracy are needed for duplicating it, and so, the cost can be decreased by using modular redundancy Therefore, providing redundancy at high levels like as modules or subsystems, can be more economical than providing redundancy at low levels or duplicating components. In this paper, the problem in which redundancy is allocated at all level in a series system is addressed, a mixed integer nonlinear programming model is presented and a genetic algorithm is proposed. An example illustrates the procedure.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.376-380
• /
• 2008

This paper deals with a performance analysis of real-time control systems, which engages DMR(dual modular redundancy) to detect transient errors and checkpointing technique to tolerate transient errors. Transient errors are caused by transient faults and the most significant type of errors in reliable computer systems. Transient faults are assumed to occur according to a Poisson process and to be detected by a dual modular redundant structure. In addition, an equidistant checkpointing strategy is considered. The probability of the successful task completion in a real-time control system where periodic checkpointing operations are performed during the execution of a real-time control task is derived. Numerical examples show how checkpoiniting scheme influences the probability of task completion. In addition, the result of the analysis is compared with the simulation result.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1717-1722
• /
• 2016

Availability, one of the important metrics used to assess the performance of network system, is defined as the probability that a system is operational at a given point in time under a given set of environmental conditions. To improve the availability of the network service, the redundancy models and the rejuvenation schemes are the effective schemes to be typically used. In this paper, we analyse the effect of 2N redundancy model and/or rejuvenation scheme on the availability of network service. The 2N redundancy model consists of one active and one standby component and the performance of time-based rejuvenation scheme mainly depends on its rejuvenation period. We design stochastic reward net model for the 2N redundancy model with time-based rejuvenation scheme and analyse the service availability of the model using stochastic Petri net package. We provide some numerical examples of the service availability, which shows that the system with rejuvenation has higher availability than the system without rejuvenation.