Subnetwork reliability analysis about complete-transposition graph networks

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-06-20 DOI:10.1016/j.tcs.2025.115421

Qun Chen, Qingying Deng, Kainan Xiang

{"title":"Subnetwork reliability analysis about complete-transposition graph networks","authors":"Qun Chen, Qingying Deng, Kainan Xiang","doi":"10.1016/j.tcs.2025.115421","DOIUrl":null,"url":null,"abstract":"<div><div>As multiprocessor computer systems expand in size and complexity, the probability of encountering faulty processors within the system also increases. Understanding and evaluating the impact of these faulty processors on the entire system is critical. Reliability assessment serves as a key metric for quantifying the effect of faulty processors on the overall system performance. A widely used method for evaluating system reliability is to compute the probability that a fault-free subsystem of a given size remains operational when the system contains some faulty processors. A higher probability indicates greater system reliability. In this paper, we utilize the probability fault model and the Inclusion-Exclusion principle to analyze the <span><math><mi>C</mi><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msub></math></span> subnetwork reliability of <span><math><mi>C</mi><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> under node failures. We derive the upper and lower bounds on the <span><math><mi>C</mi><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msub></math></span>-reliability of the <span><math><mi>C</mi><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> by analyzing the intersection of up to five <span><math><mi>C</mi><msub><mrow><mi>T</mi></mrow><mrow><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msub></math></span> subnetworks. Furthermore, our findings demonstrate that the theoretical results closely match simulation results, particularly when the single-node reliability value <em>p</em> is low.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1053 ","pages":"Article 115421"},"PeriodicalIF":1.0000,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525003597","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

Abstract

As multiprocessor computer systems expand in size and complexity, the probability of encountering faulty processors within the system also increases. Understanding and evaluating the impact of these faulty processors on the entire system is critical. Reliability assessment serves as a key metric for quantifying the effect of faulty processors on the overall system performance. A widely used method for evaluating system reliability is to compute the probability that a fault-free subsystem of a given size remains operational when the system contains some faulty processors. A higher probability indicates greater system reliability. In this paper, we utilize the probability fault model and the Inclusion-Exclusion principle to analyze the

C T_{n - 1}

subnetwork reliability of

C T_{n}

under node failures. We derive the upper and lower bounds on the

C T_{n - 1}

-reliability of the

C T_{n}

by analyzing the intersection of up to five

C T_{n - 1}

subnetworks. Furthermore, our findings demonstrate that the theoretical results closely match simulation results, particularly when the single-node reliability value p is low.

查看原文本刊更多论文

完全换位图网络的子网可靠性分析

随着多处理器计算机系统在规模和复杂性上的扩展，系统中遇到故障处理器的可能性也在增加。理解和评估这些故障处理器对整个系统的影响是至关重要的。可靠性评估是量化故障处理器对系统整体性能影响的关键指标。评估系统可靠性的一种广泛使用的方法是计算给定大小的无故障子系统在系统包含一些故障处理器时保持运行的概率。概率越大，系统可靠性越高。本文利用概率故障模型和包容-排除原理，分析了节点故障情况下CTn - 1子网的可靠性。我们通过分析多达5个CTn - 1子网的交集，推导出CTn - 1可靠性的上界和下界。此外，我们的研究结果表明，理论结果与仿真结果非常吻合，特别是当单节点可靠性值p较低时。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.