The \(M/M/1\) queue with synchronized abandonments (Q543559): Difference between revisions

The author considers an \(M/M/1\) queueing system, in which customers arrive according to Poisson input with rate \(\lambda\). Customers are served according to first-come-first-served discipline, and the rate of customers' service is \(\mu\). Customers become impatient and perform synchronized abandonments in the following way. There is included a tagged Poisson process with rate \(\nu\), and at each moment, each of the customers present at the system decides to abandon with probability \(p\), or to remain in the system with complementary probability \(1-p\). Two different situations are studied. In one of them, at the moment of tagged Poisson process all customers including a customer in service become impatient. In the other situation, the customer in service is excluded, and only the waiting customers become impatient. Some extension to the \(M/M/c\) queueing system is considered as well. The paper studies stationary behaviour, busy period, condition sojourn time distribution deriving exact formulae and providing iterative algorithmic schemes. Various limiting regimes are studied and some performance analysis is given.