Upper and lower bounds for the waiting time in the symmetric shortest queue system

DOI10.1007/BF02024665zbMath0795.60090OpenAlexW2121943414MaRDI QIDQ1315342

Geert-Jan van Houtum, Jan van der Wal, Ivo J. B. F. Adan

Publication date: 7 April 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02024665

zbMATH Keywords

numerical analysisperformance characteristicsmatrix- geometric techniquethreshold blockingthreshold jockeying

Mathematics Subject Classification ID

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

Related Items (14)

A NEW LOOK ON THE SHORTEST QUEUE SYSTEM WITH JOCKEYING ⋮ Bad luck when joining the shortest queue ⋮ Analysis of a two incongruent arrivals and services M/G/1 queue with random feedback ⋮ A load balancing system in the many-server heavy-traffic asymptotics ⋮ Stationary analysis of the shortest queue problem ⋮ The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations ⋮ Some first passage time problems for the shortest queue model ⋮ Analysis of two queues in parallel with jockeying and restricted capacities ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE ⋮ Stochastic Bounds for Queueing Systems with Multiple On–Off Sources ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Transient analysis of two queues in parallel with jockeying ⋮ The M/M/c with critical jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shorter queue problem: A numerical study using the matrix-geometric solution
• A numerically stable algorithm for two server queue models
• A general class of Markov processes with explicit matrix-geometric solutions
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
• Matrix-geometric analysis of the shortest queue problem with threshold jockeying
• Ein Wartesystem mit zwei parallelen Warteschlangen
• A service system with two parallel queues
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel
• The autostrada queueing problem
• Iterative Bounds on the Equilibrium Distribution of a Finite Markov Chain
• J.comput. appl. math
• The shortest queue problem
• Two Parallel Queues with Dynamic Routing
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• Power Series for Stationary Distributions of Coupled Processor Models
• A Basic Dynamic Routing Problem and Diffusion
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• The Power-Series Algorithm Applied to the Shortest-Queue Model

This page was built for publication: Upper and lower bounds for the waiting time in the symmetric shortest queue system