Project management for arbitrary random durations and cost attributes by applying network approaches
Computers & Mathematics with Applications
Computers and Operations Research
Routing policy of stochastic-flow networks under time threshold and budget constraint
Expert Systems with Applications: An International Journal
On performance evaluation of ERP systems with fuzzy mathematics
Expert Systems with Applications: An International Journal
Time version of the shortest path problem in a stochastic-flow network
Journal of Computational and Applied Mathematics
Optimal routing policy of a stochastic-flow network
Computers and Industrial Engineering
A novel algorithm to evaluate the performance of stochastic transportation systems
Expert Systems with Applications: An International Journal
Optimal pair of minimal paths under both time and budget constraints
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Fuzzy model-based robust networked control for a class of nonlinear systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A simple universal generating function method to search for all minimal paths in networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Reliability evaluation for overall-terminal multistate flow networks with bi-directed arcs
Expert Systems with Applications: An International Journal
Optimal resource assignment to maximize multistate network reliability for a computer network
Computers and Operations Research
Applying Lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems
Computers and Industrial Engineering
A method to evaluate routing policy through p minimal paths for stochastic case
Information Sciences: an International Journal
System reliability for quickest path problems under time threshold and budget
Computers & Mathematics with Applications
Information Sciences: an International Journal
Stochastic flow networks via multiple paths under time threshold and budget constraint
Computers & Mathematics with Applications
A method to evaluate the routing policy with two minimal paths within time threshold
Expert Systems with Applications: An International Journal
Transmission reliability of k minimal paths within time threshold
Computers and Industrial Engineering
Performance evaluation for a transportation system in stochastic case
Computers and Operations Research
On performance evaluation for a multistate network under spare routing
Information Sciences: an International Journal
Stochastic computer network under accuracy rate constraint from QoS viewpoint
Information Sciences: an International Journal
Hi-index | 0.01 |
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