Analysis of the asymmetrical shortest two-server queueing model

DOI10.1155/S1048953398000112MaRDI QIDQ1270299zbMATH OpenFDO

Authors J. W. Cohen

Publication date 3 October 1999

Published in Journal of Applied Mathematics and Stochastic Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/48254

zbMATH Keywords

asymmetrical shortest queuegenerating functionsmeromorphic functionsnearest neighbor random walkqueue length

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

This lengthy paper deals with the analytic solution of a two server queueing model with Poisson arrivals in which an arriving customer joins the shorter queue if the queue lengths are unequal; if they are equal he joins the queue in front of server \(i\) with probability \(\pi_i\) \((i=1,2)\). The service time at counter \(i\) has negative exponential distribution with rate \(1/\beta_i\) \((i=1,2)\). The study of this model known as ``two server shortest queue or ``two queues in parallel is mostly concerned with the symmetrical case in which \(\pi_1= \pi_2=1/2\) and \(\beta_1= \beta_2\). In the present analysis of the asymmetrical model, the bivariate generating function of the stationary joint distribution of the queue length, which provides the necessary performance measures, is determined in terms of four generating functions, each of which is a sum of a polynomial and a meromorphic function. It is shown that the poles and the residues of the meromorphic functions can be calculated recursively and the coefficients of the polynomials can be easily found, in particular, if the asymmetry in the model is not very large. The approach developed in this article seems to be applicable to a larger class of random walks modelling asymmetrical two-dimensional queues.

Recommendations

• Analysis of the asymmetric shortest queue problem
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• A two-queue, one-server model with priority for the longer queue
• J.comput. appl. math
• On the infinite server shortest queue problem: non-symmetric case

Cited in

(25)

• Malyshev's theory and JS-queues. Asymptotics of stationary probabilities
• Stationary analysis of the shortest queue problem
• 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
• Asymptotic behavior for MAP/PH/\(c\) queue with shortest queue discipline and jockeying
• Martingales and buffer overflow for the symmetric shortest queue model
• A polling system with `join the shortest -- serve the longest' policy
• Analysis of two queues in parallel with jockeying and restricted capacities
• Analysis of the asymmetric shortest queue problem
• Asymptotic analysis of a queueing system by a two-dimensional state space
• The shorter queue polling model
• An ASIP model with general gate opening intervals
• The Longer Queue Model
• J.comput. appl. math
• Transient analysis of two queues in parallel with jockeying
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• Analysis of job assignment with batch arrivals among heterogeneous servers
• Matrix geometric approach for random walks: stability condition and equilibrium distribution
• Stationary analysis of the shortest queue first service policy
• scientific article; zbMATH DE number 836619 (Why is no real title available?)
• Stationary analysis of the ``shortest queue first service policy: the asymmetric case
• A finite compensation procedure for a class of two-dimensional random walks
• Harmonic functions for singular quadrant walks
• A 3-queue polling system with join the shortest-serve the longest policy
• The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times

This page was built for publication: Analysis of the asymmetrical shortest two-server queueing model

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