Network reliability and algebraic structures
Network reliability and algebraic structures
Performance and reliability analysis of computer systems: an example-based approach using the SHARPE software package
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Hybrid analysis of SGSPNs with time-dependent transition rates
Performance Evaluation
Bound Computation of Dependability and Performance Measures
IEEE Transactions on Computers
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Network Reliability: Experiments with a Symbolic Algebra Environment
Network Reliability: Experiments with a Symbolic Algebra Environment
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Adaptive statistical algorithms in network reliability analysis
Performance Evaluation
| Hi-index | 0.00 |
We present improved techniques for bounding the expectation of a performance measure over a very large state space generated by a system of independent components, each of which has an arbitrary number of states (called ''modes''), when the values of the measure are known only on a subset of the global state space. Our results apply to any algorithm that evaluates performability by state generation, and consist of bounds in closed form or proofs that certain bounds cannot be improved. We give two example applications of our results, one to a large communications network and the other to a small database system.