A method to evaluate routing policy through \(p\) minimal paths for stochastic case
From MaRDI portal
Publication:621591
DOI10.1016/j.ins.2010.07.036zbMath1210.68015OpenAlexW1984756228MaRDI QIDQ621591
Publication date: 28 January 2011
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.07.036
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)
Related Items (3)
Evaluating the reliability of a novel deterioration-effect multi-state flow network ⋮ A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network ⋮ Performance evaluation for a transportation system in stochastic case
Cites Work
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths
- A fuzzy approach to hierarchical multiobjective programming problems and its application to an industrial pollution control problem
- Minimum cost-reliability ratio path problem
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- Minimum time paths in a network with mixed time constraints.
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- A label-setting algorithm for finding a quickest path
- An algorithm for ranking quickest simple paths
- The all-pairs quickest path problem
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability Evaluation of Multistate Systems with Multistate Components
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: A method to evaluate routing policy through \(p\) minimal paths for stochastic case
