Stationary analysis of the ``shortest queue first service policy: the asymmetric case

DOI10.1080/15326349.2016.1269291MaRDI QIDQ4976518zbMATH OpenOpenAlexFDO

Authors Alain Simonian, Fabrice M. Guillemin

Publication date 31 July 2017

Published in Stochastic Models (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.3496

zbMATH Keywords

queueingperformance evaluationMarkov processesfunctional equationsstochastic scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on general state spaces (60J25) Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05) Stochastic scheduling theory in operations research (90B36)

Abstract: As a follow-up to a recent paper considering two symmetric queues, the extit{Shortest Queue First} service discipline is presently analysed for two general asymmetric queues. Using the results previously established and assuming exponentially distributed service times, the bivariate Laplace transform of workloads in each queue is shown to depend on the solution $mathbfM$ to a two-dimensional functional equation ${\displaystyle }$ mathbf{M} = Q_1 cdot mathbf{M}circ h_1 + Q_2 cdot mathbf{M}circ h_2 + mathbf{L} ${\displaystyle }$ with given matrices $Q_1$, $Q_2$ and vector $mathbfL$ and where functions $h_1$ and $h_2$ are defined each on some rational curve; solution $mathbfM$ can then represented by a series expansion involving the semi-group $<h_1,h_2>$ generated by these two functions. The empty queue probabilities along with the tail behaviour of the workload distribution at each queue are characterised.

Recommendations

• Stationary analysis of the shortest queue first service policy
• Analysis of the asymmetric shortest queue problem
• J.comput. appl. math
• Analysis of the asymmetrical shortest two-server queueing model
• A new heavy traffic limit for the asymmetric shortest queue problem

Cites work

• scientific article; zbMATH DE number 3983541 (Why is no real title available?)
• A two-queue, one-server model with priority for the longer queue
• Random walks in the quarter-plane with zero drift: an explicit criterion for the finiteness of the associated group
• Rate conservation laws for multidimensional processes of bounded variation with applications to priority queueing systems
• Stationary analysis of the shortest queue first service policy
• The equivalence between processor sharing and service in random order.
• Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
• Two queues in parallel

Cited in

(3)

• The tail behavior of a longest-queue-served-first queueing system: a random walk in the half plane
• Stationary analysis of the shortest queue first service policy
• Serve the shortest queue and Walsh Brownian motion

This page was built for publication: Stationary analysis of the ``shortest queue first service policy: the asymmetric case

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