On the stochastic domination for batch-arrival, batch-service and assemble-transfer queueing networks

DOI10.1239/jap/1067436103zbMath1076.60079OpenAlexW2000425732MaRDI QIDQ4819519

Antonis Esconomou

Publication date: 27 September 2004

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1067436103

zbMATH Keywords

stochastic orderqueueing networkassemble-transfer network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items

Necessary and sufficient conditions for strong comparability of multicomponent systems ⋮ Local conditions for the stochastic comparison of particle systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic ordering and dependence in applied probability
• An alternative model for queueing systems with single arrivals, batch services and customer coalescence
• Stochastic domination and Markovian couplings
• Stochastic Orderings for Markov Processes on Partially Ordered Spaces
• Geometric product form queueing networks with concurrent batch movements
• Partial balances in batch arrival batch service and assemble-transfer queueing networks
• A Geometric Product-Form Distribution for a Queueing Network by Non-Standard Batch Arrivals and Batch Transfers
• A stochastic lower bound for assemble-transfer batch service queueing networks
• NECESSARY AND SUFFICIENT CONDITIONS FOR THE STOCHASTIC COMPARISON OF JACKSON NETWORKS