A permutation-and-backtrack approach for reliability evaluation in multistate information networks

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2020-05-15

類型

期刊名稱

APPLIED MATHEMATICS AND COMPUTATION

卷期與頁次

第 373 卷

ISSN

0096-3003

語言

英文

摘要

Nowadays, people live heavily on information systems to handle their business and schedules. A reliable information system helps people smoothly and efficiently deal with their daily-life affairs. An information system usually consists of connected software and hardware components, and can be modeled by connected graphs. In network theory, such graphs are called multistate information networks. Therefore, the reliability of an information system can be evaluated by network theory, namely network reliability. The most popular approach to evaluate network reliability is the three-stage-approach (TSA), which involves (a) finding all minimal paths (MPs), (b) finding all d-system vectors (d-SVs), and (c) calculating the union probability of d-SVs for reliability. Approaches for creating all MPs has been reported. There is a need for a more efficient approach to generate all d-SVs for such calculation. In this article, an approach based on permutation-and-backtrack facility is proposed to generate all such d-SVs. The efficiency of this approach is generally accepted to be superior to the existing approaches. The proposed approach provides us an efficient, and simple way to speed up TSA as a more powerful tool for evaluating the reliability of multistate information networks. (C) 2020 Elsevier Inc. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, S.-G., & Lin, Y.-K. (2020). A permutation-and-backtrack approach for reliability evaluation in multistate information networks. APPLIED MATHEMATICS AND COMPUTATION, 373, 0. https://doi.org/10.1016/j.amc.2019.125024

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/153819