Explicit Solution of a Quorum Queueing System

From MaRDI portal





An \(M/G/1\)-type queueing system is considered where server takes a batch of \(r\) customers to serve with a distribution \(B\) (and waits if queue size is less). An explicit solution for steady-state queue-size probabilities both for the discrete time case (when the queue at the completion service times is considered) and for the continuous time case is found in terms of zeros inside and/or outside the closed unit ball, of the characteristic equation. This equation includes the Laplace-Stieltjes transform of the service time distribution \(B\). Mean queue size in both cases is found.











This page was built for publication: Explicit Solution of a Quorum Queueing System

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