Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Minimum cost-reliability ratio path problem
Computers and Operations Research
Computers and Operations Research
An algorithm for finding the k quickest paths in a network
Computers and Operations Research
Information Processing Letters
The all-pairs quickest path problem
Information Processing Letters
Finding the k quickest simple paths in a network
Information Processing Letters
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Computers and Operations Research
Minimum time paths in a network with mixed time constraints
Computers and Operations Research
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
A label-setting algorithm for finding a quickest path
Computers and Operations Research
An algorithm for ranking quickest simple paths
Computers and Operations Research
Availability guarantee in survivable WDM mesh networks: A time perspective
Information Sciences: an International Journal
Computers and Operations Research
Optimal routing policy of a stochastic-flow network
Computers and Industrial Engineering
An optimal QoS-based Web service selection scheme
Information Sciences: an International Journal
Information Sciences: an International Journal
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.07 |
This paper focuses on a multistate network composed of multistate edges to study the relationship between transmission reliability and spare routing. In the network, each edge has several possible capacities and may fail due to failure, maintenance, etc. Hence, the minimum transmission time to send a given amount of data is not a fixed number. The spare routing is a transmission rule which indicates the first and the second priority pairs of minimal paths. The second one takes charge of the transmission duty if the first one is out of order. We evaluate the probability that the required amount of data can be sent through a pair of minimal paths simultaneously under both time threshold and budget constraint. Such a probability is named transmission reliability which can be regarded as a performance index to measure the transmission capability of a multistate network. An efficient solution procedure is thus proposed to generate all lower boundary points meeting the constraints. The transmission reliability is calculated in terms of such points.