ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET
From MaRDI portal
Publication:2911992
DOI10.1142/S0217595912400210zbMath1247.90134OpenAlexW2151041653MaRDI QIDQ2911992
Publication date: 13 September 2012
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595912400210
Reliability, availability, maintenance, inspection in operations research (90B25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Distributed algorithms for the quickest path problem
- On the quickest path problem
- 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
- SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
- ENHANCING INTERNET NETWORK RELIABILITY WITH INTEGRATED FRAMEWORK OF MULTI-OBJECTIVE GENETIC ALGORITHM AND MONTE CARLO SIMULATION
- Reliability Bounds for Multistate Systems with Multistate Components
- Deterministic network optimization: A bibliography
- 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
This page was built for publication: ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET