A single-server retrial queueing system with finite buffer, Poisson arrivals and arbitrary distribution of service time is considered. If a customer from outside finds the buffer completely occupied he joins a finite retrial queue (or orbit) in order to seek service again after an exponentially distributed interval of time. In case an arriving customer finds the buffer and the retrial queue completely full he is lost. The stationary distribution of underlying Markov process is derived.
The M/G/1/r Queueing System with Finite Buffer and Retrials
D'APICE, Ciro;
2001-01-01
Abstract
A single-server retrial queueing system with finite buffer, Poisson arrivals and arbitrary distribution of service time is considered. If a customer from outside finds the buffer completely occupied he joins a finite retrial queue (or orbit) in order to seek service again after an exponentially distributed interval of time. In case an arriving customer finds the buffer and the retrial queue completely full he is lost. The stationary distribution of underlying Markov process is derived.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
