Finite-buffer queues with workload-dependent service and arrival rates (Q2572910)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finite-buffer queues with workload-dependent service and arrival rates
scientific article

    Statements

    Finite-buffer queues with workload-dependent service and arrival rates (English)
    0 references
    0 references
    7 November 2005
    0 references
    An M/G/1-system with restricted accessibility is considered: the admittance of customers depends on the amount of work upon arrival and its own service time. Three main rejection rules are considered: 1) the finite dam with partial rejection rule; 2) impatient customers; 3) queues with the complete rejection rule. A proportionality relation between finite and infinite-buffer systems is presented. This is an extension of the corresponding result for two systems without restriction and with the same ratio of arrival rate and service speed. An explicit expression for the cycle maximum in a state-dependent M/G/1 queue is obtained. A formal solution for the steady-state workload density in finite-buffer M/G/1 system is obtained using a Volterra integral equation.
    0 references
    restricted accessibility
    0 references
    finite buffer
    0 references
    impatience
    0 references
    state-dependent rates
    0 references
    cycle maximum
    0 references
    level-crossing
    0 references
    Volterra integral equation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers