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
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Time version of the shortest path problem in a stochastic-flow network
Journal of Computational and Applied Mathematics
Computers and Electrical Engineering
Spectral efficiency of cognitive radio networks under interference constraint and QoS guarantees
Computers and Electrical Engineering
Design of multi-path data routing algorithm based on network reliability
Computers and Electrical Engineering
| Hi-index | 0.00 |
From the viewpoint of quality of service, packet error rate (PER) and latency are both critical performance indicators to assess internet quality for supervisor and customers. A computer system is usually modeled as a network topology with arcs and vertices where each arc denotes a delivery medium and each vertex denotes an Internet data center. Each component (arc and vertex) of a network should be considered as multi-state owing to the failure, partial failure, maintenance, etc., of the components. Evaluating the delivery reliability of a network with imperfect vertices is a complicated process. This type of network, called a multi-state imperfect vertex computer network, is addressed in this paper. We study how data can be delivered through multiple minimal paths simultaneously within the permitted PER and latency. An algorithm is proposed to assess delivery reliability. To show the efficiency and effectiveness of the proposed solution, we implemented the proposed solution on practical computer networks.