Retrial queues with recurrent demand option (Q1925153)

From MaRDI portal
Revision as of 06:15, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Retrial queues with recurrent demand option
scientific article

    Statements

    Retrial queues with recurrent demand option (English)
    0 references
    18 March 1997
    0 references
    Summary: The object of this paper is to analyze the model of a queueing system in which customers can call it only to request service: if the server is free, the customer enters service immediately. Otherwise, if the service system is occupied, the customer joins a source of unsatisfied customers called the orbit. On completion of each service the recipient of service has an option of leaving the system completely with probability \(1-p\) or returning to the orbit with probability \(p\). We consider two models characterized by the discipline governing the order of requests for service from the orbit. First, all the customers from the orbit apply at a fixed rate. Secondly, customers from the orbit are discouraged and reduce their rate of demand as more customers join the orbit. The arrival at and the demands from the orbit are both assumed to be according to the Poisson process. However, the service times for both primary customers and customers from the orbit are assumed to have a general distribution. We calculate several characteristic quantities of these queueing systems.
    0 references
    single line queue
    0 references
    repeated demands
    0 references
    orbit size
    0 references
    waiting time
    0 references
    ergodic state
    0 references
    generating function
    0 references
    retrial queue
    0 references
    recurrent customer
    0 references
    0 references
    0 references

    Identifiers