Stochastic comparisons for fork-join queues with exponential processing times

DOI10.2307/3215387MaRDI QIDQ4358597zbMATH OpenOpenAlexFDO

Authors Tapani Lehtonen, Esther Frostig

Publication date 20 September 1998

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

Full work available at URL https://doi.org/10.2307/3215387

zbMATH Keywords

fork-join queuesstochastic orderingweak majorization

Mathematics Subject Classification ID

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

Recommendations

• Stochastic comparisons for bulk queues
• Stochastic comparisons for single-server queues
• Stochastic bounds in Fork-Join queueing systems under full and partial mapping
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• On the Diffusion Approximation to a Fork and Join Queueing Model
• scientific article; zbMATH DE number 1560899
• Large fork-join queues with nearly deterministic arrival and service times
• ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics

Cited in

(2)

• ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
• Stochastic bounds in Fork-Join queueing systems under full and partial mapping

This page was built for publication: Stochastic comparisons for fork-join queues with exponential processing times

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