Approximating the mean response time of parallel queues with JSQ policy

DOI10.1016/0305-0548(95)00080-1zbMath0854.90065OpenAlexW1972672349MaRDI QIDQ1919783

Hwa-Chun Lin, Cauligi S. Raghavendra

Publication date: 19 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00080-1

zbMATH Keywords

parallel queuesjoin the shortest queuebirth-death Markov processmean system size rallel queues

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shorter queue problem: A numerical study using the matrix-geometric solution
• Two Similar Queues in Parallel
• The shortest queue problem
• A note on waiting times in systems with queues in parallel
• A simple dynamic routing problem
• Two queues in parallel
• Optimality of the shortest line discipline
• A Basic Dynamic Routing Problem and Diffusion

This page was built for publication: Approximating the mean response time of parallel queues with JSQ policy