A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time (Q1186348)

From MaRDI portal
Revision as of 09:38, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time
scientific article

    Statements

    A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    Summary: This paper introduces a bulk queueing system with a single server processing groups of customers of a variable size. If upon completion of service the queueing level is at least \(r\), the server takes a batch of size \(r\) and processes it a random time arbitrarily distributed. If the queueing level is less than \(r\), the server idles until the queue accumulates \(r\) customers in total. Then the server capacity is generated by a random number equals the batch size taken for service which lasts an arbitrarily distributed time dependent on the batch size. The objective of the paper is the stationary distribution of queueing process which is studied via semi-regenerative techniques. An ergodicity criterion for the process is established and an explicit formula for the generating function of the distribution is obtained.
    0 references
    Markov renewal process
    0 references
    bulk queueing system
    0 references
    stationary distribution
    0 references
    semi-regenerative techniques
    0 references
    ergodicity criterion
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references