A Note on Time Monotonicity for Performability Models

DOI10.1017/S0269964800004356zbMath1095.60518OpenAlexW2025639384MaRDI QIDQ5485372

Nico M. van Dijk

Publication date: 30 August 2006

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800004356

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

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

This page was built for publication: A Note on Time Monotonicity for Performability Models