TWO QUEUES IN PARALLEL
From MaRDI portal
Publication:3259326
DOI10.1093/biomet/45.3-4.401zbMath0086.33801OpenAlexW2045106481MaRDI QIDQ3259326
Publication date: 1958
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/45.3-4.401
Related Items
Matrix-geometric analysis of the shortest queue problem with threshold jockeying ⋮ A NEW LOOK ON THE SHORTEST QUEUE SYSTEM WITH JOCKEYING ⋮ Erlang arrivals joining the shorter queue ⋮ Bad luck when joining the shortest queue ⋮ Analysis of the asymmetric shortest queue problem ⋮ Shortest expected delay routing for Erlang servers ⋮ Analysis of a two incongruent arrivals and services M/G/1 queue with random feedback ⋮ Analysis of the symmetric join the shortest orbit queue ⋮ Observing general service queues before joining ⋮ A level-crossing approach to the solution of the shortest-queue problem ⋮ A solution for queues with instantaneous jockeying and other customer selection rules ⋮ Approximations for a queueing game model with join-the-shortest-queue strategy ⋮ Stationary analysis of the shortest queue problem ⋮ Stability of Parallel Server Systems ⋮ The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations ⋮ Steady-state analysis of shortest expected delay routing ⋮ Routing jobs with deadlines to heterogeneous parallel servers ⋮ STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES ⋮ Optimal Routing of Fixed Size Jobs to Two Parallel Servers ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Optimality of routing and servicing in dependent parallel processing systems ⋮ Unnamed Item ⋮ Web server load balancing: a queueing analysis ⋮ GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES ⋮ Analysis of two queues in parallel with jockeying and restricted capacities ⋮ Switching queues, cultural conventions, and social welfare ⋮ MAXIMUM ENTROPY REVISITED ⋮ Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues ⋮ A matrix-geometric solution of the jockeying problem ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Transient analysis of two queues in parallel with jockeying ⋮ Analysis of the shortest relay queue policy in a cooperative random access network with collisions ⋮ Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics ⋮ Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime ⋮ A note on joining strategies for two queues in parallel ⋮ A service system with two parallel queues ⋮ A Queueing System with Two Parallel Lines, Cost-Conscious Customers, and Jockeying ⋮ Balancing queues by mean field interaction ⋮ The shorter queue problem: A numerical study using the matrix-geometric solution ⋮ A numerically stable algorithm for two server queue models ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system ⋮ Unnamed Item ⋮ The shortest queue model with jockeying
