On the Reliability of K-node set in Distributed System
博士 === 國立交通大學 === 資訊工程系 === 89 === In the reliability analysis of a distributed system, k-node set reliability is defined as the probabilities that all nodes in K are connected, where K denotes a subset of set of processing elements. A k-node set reliability computation can be very hard with exponen...
Main Authors: | Chin-Ching Chiu, 邱錦清 |
---|---|
Other Authors: | Yi-Shiung Yeh |
Format: | Others |
Language: | en_US |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/47673315563245820986 |
Similar Items
-
K-node set reliability optimization of a distributed computing system using particle swarm algorithm
by: I. N. Chiroma, et al.
Published: (2010-08-01) -
A Novel Approach for Determination of Reliability of Covering a Node from <i>K</i> Nodes
by: Biljana Panić, et al.
Published: (2020-09-01) -
Expansion Planning of Distribution Systems Considering Distributed Generation and Reliability Cost
by: Shian-Chun Chiu, et al.
Published: (2009) -
Adaptive Triple Modular Redundancy Technique for Reliability Enhancement of Phase Change Memory
by: Chin-Yang Chiu, et al.
Published: (2018) -
System Reliability Analysis Based On Weibull Distribution and Hesitant Fuzzy Set
by: Akshay Kumar, et al.
Published: (2018-12-01)