Erlang arrivals joining the shorter queue

DOI10.1007/S11134-012-9324-8MaRDI QIDQ2375751zbMATH OpenOpenAlexFDO

Authors Ivo Adan, Stella Kapodistria, Johan S. H. van Leeuwaarden

Publication date 14 June 2013

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-012-9324-8

zbMATH Keywords

queueing theoryqueues and services

Mathematics Subject Classification ID

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

Review text

This paper presents an analysis of a system in which, upon arrival, customers join the shortest of two single-server queues. The customers' service times are independent and exponentially distributed with a mean of one, irrespective of which queue they joined. The arrivals form a reneval process with Erlang interarrival times with the mean \(k/\lambda\) so that each interarrival time consists of \(k\) independent exponential phases with the mean \(1/\lambda\) respectively. Under these Markovian assumptions, this system rises to a Markov chain on a multi-layered quarter plane. In other words, the system can be described as a three-dimensional Markovian chain, whose state space consists of a \(k\)-layered quarter plane. When \(\rho = \lambda/2k<1\), this Markov chain is ergodic and equilibrium distribution exists. In this paper, an explicit expression for the equilibrium distribution in terms of an infinity series of geometric terms is derived.

Recommendations

• Shortest expected delay routing for Erlang servers
• On the shortest queue version of the Erlang loss model
• The shorter queue polling model
• J.comput. appl. math
• Deciding Which Queue to Join: Some Counterexamples

Cites work

• A compensation approach for two-dimensional Markov processes
• Analysis of the asymmetric shortest queue problem
• Decay rate for a PH/M/2 queue with shortest queue discipline
• scientific article; zbMATH DE number 3814724 (Why is no real title available?)
• scientific article; zbMATH DE number 51576 (Why is no real title available?)
• scientific article; zbMATH DE number 1300856 (Why is no real title available?)
• J.comput. appl. math
• Kakeya's Problem on the Zeros of the Derivative of a Polynomial
• Light tail asymptotics in multidimensional reflecting processes for queueing networks
• On optimality of the FCFS discipline in multiserver queueing systems and networks
• Sample path methods in the control of queues
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel

Cited in

(13)

• Analyzing \(E_k/E_r/ c\) queues
• Shortest expected delay routing for Erlang servers
• Steady-state analysis of shortest expected delay routing
• On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
• A polling system with `join the shortest -- serve the longest' policy
• Analysis of the symmetric join the shortest orbit queue
• A comparative analysis of the successive lumping and the lattice path counting algorithms
• The shorter queue polling model
• Invariant measures and error bounds for random walks in the quarter-plane based on sums of geometric terms
• Matrix geometric approach for random walks: stability condition and equilibrium distribution
• DES and RES processes and their explicit solutions
• The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations
• A 3-queue polling system with join the shortest-serve the longest policy

This page was built for publication: Erlang arrivals joining the shorter queue

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