This paper examines the Bernoulli admission control policy for the two phase bulk arrival retrial queueing system wherein the customers has the option either to take second phase of service or to leave the system after completing first essential phase of service. In addition, the arrival rate of the customers depends upon the server status. After the service completion of each individual custom...

A retrial queueing system with two types of batch arrivals, called type I and type II customers, is considered. Type I customers and type II customers arrive in batches of variable sizes according to two different Poisson processes. Service time distributions are identical and independent and are different for both types of customers. If the arriving customers are blocked due to the server bein...

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 exp...

We examine an M/M/1 retrial queue with an unreliable server whose arrival, service, failure, repair, and retrial rates are all modulated by an exogenous random environment. Provided are conditions for stability, the (approximate) orbit size distribution, and mean queueing performance measures which are obtained via matrix-analytic methods. Additionally, we consider the problem of choosing arriv...

An M/G/1 retrial queue subject to disasters and N-policy vacation is investigated in this paper. Both positive and negative customers arrival in Poisson processes independently, and positive customers receive service immediately if the server is idle upon their arrivals. Otherwise, they enter a retrial orbit and repeat their attempt again after a random time period. Once negative customers arri...

This paper analyses a discrete-time Geo/G/1 retrial queue with batch arrivals in which individual arriving customers have a control of admission. We study the underlying Markov chain at the epochs immediately after the slot boundaries making emphasis on the computation of its steady-state distribution. To this end we employ numerical inversion and maximum entropy techniques. We also establish a...

Abstract: This paper examines the steady state behavior of an M/G/1 queue with repeated attempts in which the server may provide an additional second phase of service. This model generalizes both the classical M/G/1 retrial queue and the M/G/1 queue with classical waiting line and second optional service. We carry out an extensive stationary analysis of the system, including existence of statio...

One of the classical, but yet unsolved queueing systems is the M/G/k queue with Poisson input, general service time distribution and serving facilities. In the present paper, this queue is analyzed as a piecewise–deterministic Markov process. First, an iteration formula for the transient distributions is derived. This formula is a new result for piecewise–deterministic Markov processes, too, si...

We analyze circuit switching in a multiprocessor network where connection requests or sessions arrive at each node of the network according to a Poisson process with rate Each session joins the appropriate input queue at its source node and upon advancing to the head of the queue transmits a set up packet to establish a connection If the set up packet is successful it reserves the links on the ...

We consider an M/G/1 retrial queue with general retrial times and single working vacation. During the working vacation period, customers can be served at a lower rate. Both service times in a vacation period and in a service period are generally distributed random variables. Using supplementary variable method we obtain the probability generating function for the number of customers and the ave...