A heuristic technique for generating minimal path and cutsets of a general network
Computers and Industrial Engineering
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
Conceptual design of remote monitoring and fault diagnosis systems
Information Systems
Application controlled caching for web servers
Enterprise Information Systems
A security evaluation approach for information systems in telecommunication enterprises
Enterprise Information Systems
Time version of the shortest path problem in a stochastic-flow network
Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
An SVM-based machine learning method for accurate internet traffic classification
Information Systems Frontiers
On the principle of design of resilient systems-application to enterprise information systems
Enterprise Information Systems - Resilient Enterprise Information Systems
A framework for investigation into extended enterprise resilience
Enterprise Information Systems - Resilient Enterprise Information Systems
Architectural design for resilience
Enterprise Information Systems - Resilient Enterprise Information Systems
Modelling dependable collaborative time-constrained business processes
Enterprise Information Systems - Resilient Enterprise Information Systems
Measurement of resilience and its application to enterprise information systems
Enterprise Information Systems - Resilient Enterprise Information Systems
A method to evaluate routing policy through p minimal paths for stochastic case
Information Sciences: an International Journal
Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.01 |
In a single-commodity multistate flow network, the arc capacity is stochastic and thus the system capacity (i.e. the maximum flow from the source to the sink) is not a fixed number. This paper constructs a multicommodity multistate flow network with weighted capacity allocation to model a transportation system. Each arc with cost attribute has several possible capacities. The capacity weight, the consumed amount of arc capacity by per commodity, varies with the arcs and types of commodity. We define the system capacity as a demand vector d if the system fulfills at most d. The addressed problem in this work is to measure the service quality of a transportation system. We propose a performance index, the probability that the upper bound of the system capacity equals a demand vector d subject to the budget constraint. A simple algorithm based on minimal cuts is presented to generate all (d,B)-MC that are the maximal capacity vectors meeting exactly the demand d under the budget B. The proposed performance index can be subsequently evaluated in terms of such (d,B)-MC.