Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach (Q1183674)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach
scientific article

    Statements

    Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    The authors consider the standard \(M/G/1\)-queue for service-time distributions with a rational Laplace-Stieltjes transform. They present a unified approach to the computation of the (steady-state) distribution of the queue length and the distribution of the waiting time in queue, respectively. The approach follows classical ideas using generating functions and Laplace-Stieltjes transforms. The central part of the procedure consists in evaluating the roots of the so-called characteristic equation deduced by considering the denominator of the generating function for the distribution of the queue length. Assuming that these roots are distinct, the authors use a partial fraction expansion to get representations of the distributions (and moments) in terms of these roots. Asymptotic results for the tails of the distributions are given too. The authors discuss numerical aspects and present numerical results for a variety of service time distributions.
    0 references
    0 references
    service-time distributions
    0 references
    Laplace-Stieltjes transform
    0 references
    generating functions
    0 references
    distribution of the queue length
    0 references
    numerical aspects
    0 references