AnMX/G/1 retrial queue with exhaustive vacations

Amar Aïssani

19 citations0/0 files storedJournal of Statistics and Management Systems

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Risk Models Age of Information Optimization

Abstract

We consider an MX /G/1 retrial queue with batch arrivals and server vacations, when the works for service and vacation tasks are arbitrary distributed. We obtain here the generating function of the number of customers in the system and in orbit in stationary regime. We also discuss stochastic decomposition property and the problem of the optimal control of the vacation policy.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 19 citations exist upstream.

References

1985Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations 1990A survey of retrial queues 1999Accessible bibliography on retrial queues 1992Retrial queues with collision arising from unslottedCSMA/CD protocol 1990Single line queue with repeated demands 1997Analysis of an M/G/1 queue with constant repeated attempts and server vacations 1984A service model in which the server is required to search for customers 1995Analysis of an M/G/1 queue with two types of impatient units

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.