22 research outputs found
Analysis of repairable M[X]/(G1,G2)/1 - feedback retrial G-queue with balking and starting failures under at most J vacations
In this paper, we discuss the steady state analysis of a batch arrival feedback retrial queue with two types of services and negative customers. Any arriving batch of positive customers finds the server is free, one of the customers from the batch enters into the service area and the rest of them get into the orbit. The negative customer, is arriving during the service time of a positive customer, will remove the positive customer in-service and the interrupted positive customer either enters the orbit or leaves the system. If the orbit is empty at the service completion of each type of service, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from a vacation. While the busy server may breakdown at any instant and the service channel may fail for a short interval of time. The steady state probability generating function for the system size is obtained by using the supplementary variable method. Numerical illustrations are discussed to see the effect of the system parameters
Analysis of repairable M[X]/(G1,G2)/1 - feedback retrial G-queue with balking and starting failures under at most J vacations
In this paper, we discuss the steady state analysis of a batch arrival feedback retrial queue with two types of service and negative customers. Any arriving batch of positive customers finds the server is free, one of the customers from the batch enters into the service area and the rest of them join into the orbit. The negative customer, arriving during the service time of a positive customer, will remove the positive customer in-service and the interrupted positive customer either enters into the orbit or leaves the system. If the orbit is empty at the service completion of each type of service, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from a vacation. The busy server may breakdown at any instant and the service channel will fail for a short interval of time. The steady state probability generating function for the system size is obtained by using the supplementary variable method. Numerical illustrations are discussed to see the effect of system parameters
Non-Markovian Queueing System, Mx/G/1 with Server Breakdown and Repair Times
This paper deals with the steady state behavior of an MX/G/1 queue with breakdown. It assumed that customers arrive to the system in batches of variable size, but serve one by one. The main new assumption in this paper is that the repair process does not start immediately after a breakdown and there is a delay time waiting for repairs to start. We obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average waiting time in the queue
Transient behavior of M[x]/G/1 Retrial Queueing Model with Non Persistent Customers, Random break down, Delaying Repair and Bernoulli Vacation
In this paper we consider a single server batch arrival non-Markovian retrial queueing model with non persistent customers. In accordance with Poisson process, customers arrive in batches with arrival rate  and are served one by one with first come first served basis. The server is being considered as unreliable that it may encounter break down at any time. In order to resume its service the server has to be sent for repair, but the repair does not start immediately so that there is a waiting time before the repair process. The customer, who finds the server busy upon arrival, can either join the orbit with probability p or he/she can leave the system with probability 1-p. More details can be found in the full paper. Key words: Batch size, break down, delay time, transient solution, steady solution, reliability indices
Mathematical Analysis of Queue with Phase Service: An Overview
We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent
Insensitive Bounds for the Stationary Distribution of a Single Server Retrial Queue with Server Subject to Active Breakdowns
The paper addresses monotonicity properties of the single server retrial queue with no waiting room and server subject to active breakdowns. The obtained results allow us to place in a prominent position the insensitive bounds for the stationary distribution of the embedded Markov chain related to the model in the study. Numerical illustrations are provided to support the results
Non Markovian Queue with Two Types service Optional Re-service and General Vacation Distribution
We consider a single server batch arrival queueing system, where the server provides two types of heterogeneous service. A customer has the option of choosing either type 1 service with probability p1 or type 2 service with probability p2 with the service times follow general distribution. After the completion of either type 1 or type 2 service a customer has the option to repeat or not to repeat the type 1 or type 2 service. As soon as the customer service is completed, the server will take a vacation with probability θ or may continue staying in the system with probability 1 -θ: The re-service periods and vacation periods are assumed to be general. Using supplementary variable technique, the Laplace transforms of time dependent probabilities of system state are derived and thus we deduce the steady state results. We obtain the average queue size and average waiting time. Some system performance measures and numerical illustrations are discussed
Recommended from our members
A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production, human computer interaction, and so on. The classical queueing system, even vacation queues or queues subject to breakdown, might not be sufficiently realistic. The purpose of this research is to extend the work done on vacation queues and on unreliable queues by studying queueing systems which take into consideration both phenomena. We study the behavior of a batch arrival queueing system with a single server, where the system is subject to random breakdowns which require a repair process, and on the other hand, the server is allowed to take a vacation after finishing a service. The breakdowns are assumed to occur while serving a customer, and when the system breaks down, it enters a repair process immediately while the customer whose service is interrupted comes back to the head of the queue waiting for the service to resume. Server vacations are assumed to follow a Bernoulli schedule under single vacation policy. We consider the above assumptions for different queueing models: queues with generalized service time, queues with two-stages of heterogeneous service, queues with a second optional service, and queues with two types of service. For all the models mentioned above, it is assumed that the service times, vacation times, and repair times all have general arbitrary distributions. Applying the supplementary variable technique, we obtain probability generating functions of queue size at a random epoch for different states of the system, and some performance measures such as the mean queue length, mean waiting time in the queue, proportion of server's idle time, and the utilization factor. The results obtained in this research, show the effect of vacation and breakdown parameters upon main performance measures of interest. These effects are also illustrated using some numerical examples and graphs.This work is funded by the Ministry of Education, Kingdom of Bahrain
Recommended from our members
On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This research investigates a batch arrival queueing system with a Bernoulli scheduled vacation and random system breakdowns. It is assumed that the repair process does not start immediately after the breakdown. Consequently there maybe a delay in starting repairs. After every service completion the server may go on an optional vacation. When the original vacation is completed the server has the option to go on an extended vacation. It is assumed that the system is equipped with a stand-by server to serve the customers during the vacation period of the main server as well as during the repair process.
The service times, vacation times, repair times, delay times and extended vacation times are assumed to follow different general distributions while the breakdown times and the service times of the stand-by server follow an exponential distribution.
By introducing a supplementary variable we are able to obtain steady state results in an explicit closed form in terms of the probability generating functions. Some important performance measures including; the average length of the queue, the average number of customers in the system, the mean response time, and the value of the traffic intensity are presented.
The professional MathCad 2001 software has been used to illustrate the numerical results in this study