Stationary analysis of the Shortest Queue First service policy

  title={Stationary analysis of the Shortest Queue First service policy},
  author={Fabrice Guillemin and Alain Simonian},
  journal={Queueing Syst.},
We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two parallel queues and assuming Poisson arrivals and general service time distributions, we first establish the functional equations satisfied by the Laplace transforms of the workloads in each queue. We further specialize these equations to the so-called “symmetric… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 14 references

veillac. An introduction to Malliavin’s calculus and to its applications, Part I: Theory

A. R̈ı∼areveill/Lecture.pdf, • 2010
View 1 Excerpt

Service differentiation by means of packet scheduling

N. Ostallo
Master’s thesis, Institut Eurecom, • 2008
View 1 Excerpt

Markov Processes

S. N. Ethier, T. G. Kurtz
Characterisation and Convergence. J.Wiley, • 2005

Bragadni , Lectures on curves , surfaces and projective varieties , A classical view of algebraic geometry

M. G.
European Mathematical Society • 2004

Galois Theory

D. A. Cox
J.Wiley Interscience • 2004

Rate conservation laws for multidimensional processes of bounded variation with application to priority queueing systems

F. Guillemin, R. Mazumdar
Methodology and Computing in Applied Probability, 6:135–149 • 2004

Stochastic Networks and Queues

P. Robert
Springer • 2003

Analysis of the asymmetrical shortest two-server queueing model

J. W. Cohen
Journal of Applied Mathematics and Stochastic Analysis, 11(2):115 – 162 • 1998
View 1 Excerpt

Existence and smoothness of transition density for jump-type Markov processes: application of Malliavin calculus

S. Hiraba
Kodai Math. J., Volume 15, Number 1, 28–49 • 1992
View 1 Excerpt

Similar Papers

Loading similar papers…