TY - JOUR

T1 - Reliability evaluation for an information network with node failure under cost constraint

AU - Lin, Yi-Kuei

PY - 2007/3/1

Y1 - 2007/3/1

N2 - The quality of service is an important index to measure the performance of an information system. This paper constructs a stochastic-flow network to model the information system. In this network, each node and arc having a designated capacity will have different lower levels due to various partial and complete failures. The studied problem is to evaluate the possibility that a given amount of multicommodity can be sent through an information network under the cost constraint. Such a possibility, which is named the mission reliability, is an appropriate performance index to measure the quality level. The terminology "flow"represents the quantity of data transmitted via such a network, and "demand"represents the required data from clients. Based on the properties of minimal paths, a simple algorithm is first proposed to generate all lower boundary points for the demand; then, the mission reliability can be calculated in terms of such points. The lower boundary point for the demand is a minimal vector, which represents the capacity of each component (arc or node), such that the demand can be fulfilled. Extending the stochastic-flow network to the node failure case, another algorithm is proposed to calculate the mission reliability.

AB - The quality of service is an important index to measure the performance of an information system. This paper constructs a stochastic-flow network to model the information system. In this network, each node and arc having a designated capacity will have different lower levels due to various partial and complete failures. The studied problem is to evaluate the possibility that a given amount of multicommodity can be sent through an information network under the cost constraint. Such a possibility, which is named the mission reliability, is an appropriate performance index to measure the quality level. The terminology "flow"represents the quantity of data transmitted via such a network, and "demand"represents the required data from clients. Based on the properties of minimal paths, a simple algorithm is first proposed to generate all lower boundary points for the demand; then, the mission reliability can be calculated in terms of such points. The lower boundary point for the demand is a minimal vector, which represents the capacity of each component (arc or node), such that the demand can be fulfilled. Extending the stochastic-flow network to the node failure case, another algorithm is proposed to calculate the mission reliability.

KW - Cost constraint

KW - Minimal paths (MPs)

KW - Mission reliability

KW - Multicommodity

KW - Node failure

KW - Stochastic-flow networks

UR - http://www.scopus.com/inward/record.url?scp=33947576796&partnerID=8YFLogxK

U2 - 10.1109/TSMCA.2006.889478

DO - 10.1109/TSMCA.2006.889478

M3 - Article

AN - SCOPUS:33947576796

VL - 37

SP - 180

EP - 188

JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems

JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems

SN - 2168-2216

IS - 2

ER -