Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
DOI10.1080/00949655.2012.751988zbMATH Open1453.90057OpenAlexW2039202845MaRDI QIDQ5220004FDOQ5220004
Publication date: 9 March 2020
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2012.751988
Recommendations
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
- Stochastic computer network under accuracy rate constraint from QoS viewpoint
- Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint
- System reliability for quickest path problems under time threshold and budget
system reliabilitylead timeaccuracy rategraphic techniquepacket loststochastic unreliable-node computer network
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Cites Work
- Title not available (Why is that?)
- 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
- 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
- The quickest path problem
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- Lower bounds on two-terminal network reliability
- Distributed algorithms for the quickest path problem
- Minimum time paths in a network with mixed time constraints.
- Reliability Evaluation of Multistate Systems with Multistate Components
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Internet packet routing: application of a \(K\)-quickest path algorithm
- Statistical estimation of internal available bandwidth
Cited In (3)
This page was built for publication: Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220004)
