A Note on Time Monotonicity for Performability Models
From MaRDI portal
Publication:5485372
DOI10.1017/S0269964800004356zbMath1095.60518MaRDI QIDQ5485372
Publication date: 30 August 2006
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Monotone matrices and monotone Markov processes
- Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
- Stochastic Comparisons for Non-Markov Processes
- Stochastic Orderings for Markov Processes on Partially Ordered Spaces
- Perturbation theory for Markov reward processes with applications to queueing systems
- Throughput bounds for closed queueing networks with queue-dependent service rates
- Monotonicity of throughput in non-Markovian networks
- Comparing counting processes and queues
- Product forms for availability models