Gnedenko, the father of the modern Reliability Theory, first derived some fundamental properties of reliable systems following rigid deductive logic. This paper shares the deductive method and infers four principal properties of repairable/maintainable systems using the Boltzmann-like entropy. In particular we calculate the reparability function and next discuss the physical meanings of the for...

This paper presents mathematical models and a solution approach to determine the optimal preventive maintenance schedules for a repairable and maintainable series system of components with an increasing rate of occurrence of failure (ROCOF). The maintenance planning horizon has been divided into discrete and equally-sized periods and in each period, three possible actions for each component (ma...

Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, we first build a bridge between locally repairable code and packing. As an application of this bridge, some optimal locally repairable codes can be obtained by packings, which gives optimal locally repairable codes with flexible parameters. Index Terms Distributed storage, loc...

In this paper, a hybrid meta-heuristic approach is proposed to optimize the mathematical model of a system with mixed repairable and non-repairable components. In this system, repairable and non-repairable components are connected in series. Redundant components and preventive maintenance strategies are applied for non-repairable and repairable components, respectively. The problem is formulate...

Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS co...

Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of [14], several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in [14] are upper bounded by the code alphabet...

This paper analyzes a system subject to repairable and non-repairable failures. Non-repairable failures lead to replacement of the system. Repairable failures, first lead to repair but they lead to replacement after a fixed number of repairs. Operating and repair times follow phase type distributions (PH-distributions) and the pattern of the operating times is modelled by a geometric process. I...

Locally repairable codes have been investigated extensively in recent years due to practical application in distributed storage as well as theoretical interest. However, not much work on asymptotical behavior of locally repairable codes has been done until now. In particular, there is a little result on constructive lower bound on asymptotical behavior of locally repairable codes. In this paper...