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
A heuristic technique for generating minimal path and cutsets of a general network
Computers and Industrial Engineering
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
Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Reliable and restricted quickest path problems
INOC'11 Proceedings of the 5th international conference on Network optimization
Hi-index | 0.09 |
Many studies on hardware framework and routing policy are devoted to reducing the transmission time for a computer network. The quickest path problem thus arises to find a path which sends a given amount of data from the source to the sink such that the transmission time is minimized. More specifically, the capacity of each arc in the network is assumed to be deterministic. However, in many real-life networks such as computer systems, telecommunication systems, etc., the capacity of each arc is stochastic due to failure, maintenance, etc. Such a network is named stochastic-flow network. Hence, the minimum transmission time is not a fixed number. We extend the quickest path problem to evaluating the probability that d units of data can be sent from the source to the sink under both time threshold T and budget B. Such a probability is named system reliability. A simple algorithm is proposed to generate all lower boundary points for (d,T,B) and the system reliability can then be computed in terms of such points.