• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.387-396
• /
• 1998

We consider the problem of determining the spare inventory level for a multiechelon repairable-item inventory system. Our model extends the previous results to the system which has an inventory at the central depot as well as at the several bases. We develop an algorithm to find spare inventory levels, which minimize the total expected cost and simultaneously satisfies a specified minimum service level. Comparisons of our algorithm with the simulation show that the algorithm is very accurate and efficient.

• International Journal of Reliability and Applications
• /
• v.16 no.1
• /
• pp.35-53
• /
• 2015

This investigation deals with reliability and sensitivity analysis of a repairable embedded system with standby wherein repairman takes multiple vacations. The hardware system consists of 'M' operating and 'S' standby components. The repairman can leave for multiple vacations of random length during its idle time. Whenever any operating unit fails, it is immediately replaced by a standby unit if available. Moreover, governing equations of an embedded system are constructed using appropriate birth-death rates. The vacation and repair time of repairman are exponentially distributed. The matrix method is used to find the steady-state probabilities of the number of failed components in the embedded system as well as other performance measures. Reliability indexes are presented. Further, numerical experiments are carried out for various system characteristics to examine the effects of different parameter. Using a special class of neuro-fuzzy systems i.e. Adaptive Network-based Fuzzy Interference Systems (ANFIS), we also approximate various performance measures. Finally, the conclusions and future research directions are provided.

• International Journal of Reliability and Applications
• /
• v.14 no.2
• /
• pp.55-70
• /
• 2013

This paper deals with the Bayesian analysis of the failure data of a repairable mechanical system subject to minimal repairs and periodic overhauls. The effect of overhauls on the reliability of the system is modeled by a proportional age reduction model and the failure process between two successive overhauls is assumed to be 2-parameter Engelhardt-Bain process (2-EBP). Power Law Process (PLP) model has a disadvantage which 2-EBP can overcome. On the basis of the observed data and of a number of suitable prior densities, point and interval estimation of model parameters, as well as quantities of relevant interest are found. Also hypothesis tests on the effectiveness of performed overhauls have been developed using Bayes factor. Sensitivity analysis of improvement parameter is carried out. Finally, a numerical application is used to illustrate the proposed method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.89-98
• /
• 1996

This paper is concerned with cost analysis model in free -replacement policy under the periodic maintenance policy The free-replacement policy with minimal repairable item is considered as follows; in a manufacturer's view point operating unit is periodically replaced, if a failure occurs between minimal repair and periodic maintenance time, unit is remained in a failure condition. Also unit undergoes minimal repair at failures in minimal-repair interval. Then total expected cost per unit time is calculated according to maintenance period Tin a viewpoint of consumer's. The expected costs are included repair cost and usage cost: operating, fixed, minimal repair and loss cost. Numerical example is shown in which failure time of item has beta distribution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1558-1561
• /
• 2020

In this paper, we propose a blockchain scheme to enhance fault tolerance in distributed storage blockchain systems. Traditional blockchain systems suffer from ever-increasing storage cost. To overcome this problem, distributed storage blockchain techniques have been proposed. Distributed storage blockchain schemes effectively reduce the storage cost, but there are still limitations in reducing recovery cost and fault tolerance. The proposed approach recovers multiple errors within a group by utilizing locally repairable codes with availability. This improves the fault tolerance of the blockchain systems. Simulation results show that the proposed scheme enhances the fault tolerance while minimizing storage cost and recovery cost compared to other state-of-art schemes.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.10a
• /
• pp.14-14
• /
• 1999

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.162-163
• /
• 1999

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.723-729
• /
• 2014

In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1671-1683
• /
• 2016

Locally repairable codes (LRCs) constitute an important class of codes for distributed storage, where repair efficiency is a key metric of system performance. In LRCs, efficient repair is achieved by small locality-number of nodes participating in the repair process. In this paper, we focus on situations where different locality is required for different nodes. We present a non-trivial extension of the recent results on multiple (or unequal) localities to the $r,{\delta}$-locality case. A new Singleton-type minimum distance upper bound is derived and an optimal code construction is provided. While the result is limited to the case of only two different localities, it should be noted that it can be directly applied to the more general case where the localities are specified not exactly but by upper limits.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.125-128
• /
• 2002

In this paper, we define an availability of network, when the states of links are modeled by alternating renewal processes. The actual availabilities of some simple networks are obtained and compared to each other.