DEPENDENCE ORDERING FOR QUEUING NETWORKS WITH BREAKDOWN AND REPAIR

DOI10.1017/S0269964806060359MaRDI QIDQ3422735zbMATH OpenFDO

Authors Hans Daduna, Rafał Kulik, Cornelia Wichelhaus, Ryszard Szekli

Publication date 13 February 2007

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

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

zbMATH Keywords

degradable Jackson networkisotone differenceMarkov processes

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Dependence in Lag for Markov Chains on Partially Ordered State Spaces with Applications to Degradable Networks
• Stochastic comparison of queueing networks
• Impact of Routeing on Correlation Strength in Stationary Queueing Network Processes
• Dependencies in Markovian networks
• Comparisons of dependence for stationary Markov processes

Cites work

• A monotonicity result for the workload in Markov-modulated queues
• Dependencies in Markovian networks
• Lower bounds for the probability of overload in certain queueing networks
• Monotonicity results for MR/GI/1 queues

Cited in

(3)

• Comparisons of dependence for stationary Markov processes
• Dependence in Lag for Markov Chains on Partially Ordered State Spaces with Applications to Degradable Networks
• Computable bounds on the spectral gap for unreliable Jackson networks

This page was built for publication: DEPENDENCE ORDERING FOR QUEUING NETWORKS WITH BREAKDOWN AND REPAIR

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