M/M/1 retrial queue with working vacations and negative customer arrivals

Abstract

The M/M/1 retrial queue with working vacations and negative customers is introduced. The arrival processes of positive customers and negative customers are Poisson. Upon the arrival of a positive customer, if the server is busy the customer would enter an orbit of infinite size and the orbital customers send their requests for service with a constant retrial rate. The single server takes an exponential working vacation once customers being served depart from the system and no customers are in the orbit. Arriving negative customers kill a batch of the positive customers waiting in the orbit randomly. Efficient methodology to compute the stationary distribution for this new queue is developed and presented.

Cite this work

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

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

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