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
Distributed cost-based update policies for QoS routing on hierarchical networks
Information Sciences—Informatics and Computer Science: An International Journal
A label-setting algorithm for finding a quickest path
Computers and Operations Research
An algorithm for ranking quickest simple paths
Computers and Operations Research
Joint QoS optimization for layered computational grid
Information Sciences: an International Journal
A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
Information Sciences: an International Journal
Aggregation in sensor networks with a user-provided quality of service goal
Information Sciences: an International Journal
Computers and Operations Research
An optimal QoS-based Web service selection scheme
Information Sciences: an International Journal
Information Sciences: an International Journal
Dynamic QoS queuing control mechanism for multimedia differentiated services
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
Performance evaluation for a transportation system in stochastic case
Computers and Operations Research
Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
Information Sciences: an International Journal
| Hi-index | 0.07 |
In this paper, a stochastic-flow network is presented to model a computer network in which each arc has various possible capacities and may fail. In order to shorten the transmission time, the transmission protocol allowing the data to be sent through multiple minimal paths simultaneously is utilized for the computer network. However, the minimum transmission time to send a given amount of data is not fixed due to the property of stochastic capacity. Accordingly, the first addressed issue is to evaluate the probability that the network is able to send the data within a time constraint by adopting the transmission protocol. Such a probability is named as transmission reliability that is regarded as a performance indicator to measure the QoS for a computer network. Without knowing all minimal paths in advance, an efficient solution procedure is proposed to calculate transmission reliability. The experimental results of 35 random networks show that the proposed algorithm can be executed efficiently. Moreover, in order to increase transmission reliability, the network administrator decides the routing policy to designate the first and the second priority p minimal paths. The second addressed issue is to evaluate transmission reliability associated with the routing policy. A sort criterion is subsequently presented to find an ideal routing policy.