A retrial single-server queueing system with finite buffer is considered. The primary incoming flow is Poissonian. If the buffer is overflown, a call entering the system becomes a repeat call and joins the group of repeat calls referred to as an orbit. The maximum number of calls that can simultaneously be contained in the orbit is limited. A call from the orbit makes new attempts to enter the system until a vacancy occurs. Time between repeat attempts for each call is an exponentially distributed random variable. At the initial moment of service, a type of a call is defined: with probability ai it becomes a call of type i and its service time in this case has distribution function Bi(x), i = 1,K. For this system, the stationary joint distribution of queues in the buffer and orbit is found. Numerical examples are given.
On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow
D'APICE, Ciro;
2001-01-01
Abstract
A retrial single-server queueing system with finite buffer is considered. The primary incoming flow is Poissonian. If the buffer is overflown, a call entering the system becomes a repeat call and joins the group of repeat calls referred to as an orbit. The maximum number of calls that can simultaneously be contained in the orbit is limited. A call from the orbit makes new attempts to enter the system until a vacancy occurs. Time between repeat attempts for each call is an exponentially distributed random variable. At the initial moment of service, a type of a call is defined: with probability ai it becomes a call of type i and its service time in this case has distribution function Bi(x), i = 1,K. For this system, the stationary joint distribution of queues in the buffer and orbit is found. Numerical examples are given.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
