Approximating the mean response time of parallel queues with JSQ policy

DOI10.1016/0305-0548(95)00080-1zbMATH Open0854.90065OpenAlexW1972672349MaRDI QIDQ1919783FDOQ1919783

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

Recommendations

• An approximation for the mean response time for shortest queue routing with general interarrival and service times
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
• Delay-join the shortest queue routing for a parallel queueing system with removable servers
• On a new numerical computation of the steady state solution for two infinite server parallel queues

zbMATH Keywords

join the shortest queueparallel queuesbirth-death Markov processmean system size rallel queues

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A simple dynamic routing problem
• Optimality of the shortest line discipline
• Two Similar Queues in Parallel
• The shortest queue problem
• Two queues in parallel
• A Basic Dynamic Routing Problem and Diffusion
• A note on waiting times in systems with queues in parallel
• Title not available (Why is that?)
• The shorter queue problem: A numerical study using the matrix-geometric solution

Cited In (1)

• Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems

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

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