A Note on Time Monotonicity for Performability Models

DOI10.1017/S0269964800004356zbMATH Open1095.60518OpenAlexW2025639384MaRDI QIDQ5485372FDOQ5485372

Authors: 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

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

Cites Work

• Comparing counting processes and queues
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perturbation theory for Markov reward processes with applications to queueing systems
• Stochastic Orderings for Markov Processes on Partially Ordered Spaces
• Monotone matrices and monotone Markov processes
• Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
• Monotonicity of throughput in non-Markovian networks
• Stochastic Comparisons for Non-Markov Processes
• Throughput bounds for closed queueing networks with queue-dependent service rates
• Product forms for availability models

Cited In (1)

• Monotonicity of the peak time in turnover models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485372)