Redundancy: How Many Unreliable Spares are Needed for High Reliability and Confidence?

被引:0
|
作者
Jones, Harry W. [1 ]
机构
[1] NASA, Ames Res Ctr, N239-8, Moffett Field, CA 94035 USA
来源
2024 ANNUAL RELIABILITY AND MAINTAINABILITY SYMPOSIUM, RAMS | 2024年
关键词
Redundancy; spares; high reliability; confidence;
D O I
10.1109/RAMS51492.2024.10457601
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper investigates the number of redundant units needed to achieve high reliability with high confidence. The approach is developed for the case when the system failure rate is too high for a single unit to provide the required reliability over the mission duration. To achieve high reliability, N redundant units can be used, one operating unit and N - 1 spares. If the unit failure rate is f, the mission length is L, and f * L is small (not the case assumed here), the unit failure probability over the mission duration is F1 = f * L << 1. In this case, the probability that all N units will fail is Ffail = F1N, and the needed redundancy N = LN(F)/LN(F1). For the case of large f * L assumed here, F1 = f * L > 1, and F1 is the expected number of failures during the mission. (When F1 = f * L << 1, F1 is the probability that a unit will fail during the mission. When F1 = f * L > 1, F1 is the expected number of failures during the mission.) The needed redundancy, N, to achieve the required N redundant unit reliability, FN, can be computed using the cumulative Poisson distribution with mean equal to F1. The number of spares, N - 1, is increased until the probability - that the total number of failures will be less than N -1 - is equal to the required reliability. The confidence that this reliability can be achieved can be computed using the cumulative Poisson distribution or the chi-square distribution. Since the measured unit failure rate, f, has some probabilistic uncertainty, the actual failure rate will be randomly higher or lower. This means that the reliability of the N redundant systems will be overestimated about half the time. Adding more redundant units increases the confidence that the required reliability will be achieved. For a fixed number of redundant units, the expected reliability and confidence can be traded off, since lower reliability goals will be achieved with higher confidence. Both the desired reliability and confidence can be specified as initial requirements and the needed number of redundant units estimated using the measured failure rate.
引用
收藏
页数:6
相关论文
共 50 条
  • [31] How many grains are needed for a provenance study?
    Vermeesch, P
    EARTH AND PLANETARY SCIENCE LETTERS, 2004, 224 (3-4) : 441 - 451
  • [32] How many query superpositions are needed to learn?
    Castro, Jorge
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2006, 4264 : 78 - 92
  • [33] How many samples are needed to leverage smoothness?
    Cabannes, Vivien
    Vigogna, Stefano
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [34] How Many Days of Pedometer Monitoring Are Needed?
    Aoyagi, Yukitoshi
    Shephard, Roy J.
    MEDICINE AND SCIENCE IN SPORTS AND EXERCISE, 2009, 41 (03): : 734 - 734
  • [35] How many photons are needed for FRET imaging?
    Esposito, Alessandro
    BIOMEDICAL OPTICS EXPRESS, 2020, 11 (02) : 1186 - 1202
  • [36] How Many Labeled License Plates Are Needed?
    Wu, Changhao
    Xu, Shugong
    Song, Guocong
    Zhang, Shunqing
    PATTERN RECOGNITION AND COMPUTER VISION (PRCV 2018), PT IV, 2018, 11259 : 334 - 346
  • [37] How many accidents are needed to show a difference?
    Hauer, Ezra
    ACCIDENT ANALYSIS AND PREVENTION, 2008, 40 (04): : 1634 - 1635
  • [38] HOW MANY SIMPLICES ARE NEEDED TO TRIANGULATE A GRASSMANNIAN?
    Govc, Dejan
    Marzantowicz, Waclaw
    Pavesic, Petar
    TOPOLOGICAL METHODS IN NONLINEAR ANALYSIS, 2020, 56 (02) : 501 - 518
  • [39] How Many Lions Are Needed to Clear a Grid?
    Berger, Florian
    Gilbers, Alexander
    Gruene, Ansgar
    Klein, Rolf
    ALGORITHMS, 2009, 2 (03): : 1069 - 1086
  • [40] How Many Copies are Needed for State Discrimination?
    Harrow, Aram W.
    Winter, Andreas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (01) : 1 - 2