Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint
Author:
- 20 February 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Vol. 37 (2) , 180-188
Abstract
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 reliabilityKeywords
This publication has 26 references indexed in Scilit:
- A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodesReliability Engineering & System Safety, 2004
- Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcsReliability Engineering & System Safety, 2002
- An efficient method for evaluating network-reliability with variable link-capacitiesIEEE Transactions on Reliability, 2001
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failureComputers & Operations Research, 2001
- ON RELIABILITY EVALUATION OF A STOCHASTIC-FLOW NETWORK IN TERMS OF MINIMAL CUTSJournal of the Chinese Institute of Industrial Engineers, 2001
- A New Algorithm to Generate d-Minimal Paths in a Multistate Flow Network with Noninteger ARC CapacitiesInternational Journal of Reliability, Quality and Safety Engineering, 1998
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsetsNetworks, 1995
- Determination of minimal upper paths for reliability analysis of planar flow networksReliability Engineering & System Safety, 1993
- Reliability Evaluation of a Flow NetworkIEEE Transactions on Reliability, 1980
- Solving multicommodity transportation problems using a primal partitioning simplex techniqueNaval Research Logistics Quarterly, 1977