A join the shorter queue model in heavy traffic

DOI10.1239/jap/1014842278zbMath0962.60094OpenAlexW2047241684MaRDI QIDQ4503220

Stephen R. E. Turner

Publication date: 13 June 2001

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

Full work available at URL: https://semanticscholar.org/paper/17b418d5741b434e5cf4c0d060f49f5c36dc33eb

zbMATH Keywords

state space collapsereflected Brownian motionresource poolingexponential networkstwo station system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)

Related Items

Optimal buffer size for a stochastic processing network in heavy traffic ⋮ Stationary analysis of the shortest queue problem ⋮ The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations ⋮ Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE ⋮ The Effect of Increasing Routing Choice on Resource Pooling ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ A polling system with `join the shortest -- serve the longest' policy