25 research outputs found
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
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
A Retrieval Queueing Model With Feedback
A multi-server retrial queuing model with feedback is considered in this paper.Input flow of calls is modeled using a Markovian Arrival Process (M AP) and the service time is assumed to follow an exponential distribution. An arriving call enters into service should there be a free server. Otherwise, in accordance to Bernoulli trials, the call will enter into an infinite orbit (referred to as a retrial orbit) to retry along with other calls to get into service or will leave the system forever. After obtaining a service each call, independent of the others, will either enter into a finite orbit (referred to as a feedback orbit) for another service or leave the system forever. The decision to enter into the feedback orbit or not is done according to another Bernoulli trial. Calls from these two buffers will compete with the main source of calls based on signals received from two independent Poisson processes.The rates of these processes depend on the phase of the M AP. The steady-state analysis of the model is carried out and illustrative numerical examples including economical aspects are presented
A Geo[X]/G[X]/1 retrial queueing system with removal work and total renewal discipline
ArtĂculo definitivo disponible a travĂ©s del doi: 10.1016/j.amc.2017.02.032In this paper we consider a discrete-time retrial queueing system with batch arrivals of geometric type and general batch services. The arriving group of customers can decide to go directly to the server expelling out of the system the batch of customers that is currently being served, if any, or to join the orbit. After a successful retrial all the customers in the orbit get service simultaneously. An extensive analysis of the model is carried out, and using a generating functions approach some performance measures of the model, such as the first distributionâs moments of the number of customers in the orbit and in the system, are obtained. The generating functions of the sojourn time of a customer in the orbit and in the system are also given. Finally, in the section of conclusions and research results the main contributions of the paper are commented.Proyecto TIN15-70266-C2-P-
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
Optimal Pricing Strategies and Customersâ Equilibrium Behavior in an Unobservable M/M/1 Queueing System with Negative Customers and Repair
This work investigates the optimal pricing strategies of a server and the equilibrium behavior of customers in an unobservable M/M/1 queueing system with negative customers and repair. In this work, we consider two pricing schemes. The first is termed the ex-post payment scheme, where the server charges a price that is proportional to the time spent by a customer in the system. The second scheme is the ex-ante payment scheme, where the server charges a flat rate for all services. Based on the reward-cost structure, the server (or system manager) should make optimal pricing decisions in order to maximize its expected profit per time unit in each payment scheme. This study also investigates equilibrium joining/balking behavior under the serverâs optimal pricing strategies in the two pricing schemes. We show, given a customerâs equilibrium, that the two pricing schemes are perfectly identical from an economic point of view. Finally, we illustrate the effect of several system parameters on the optimal joining probabilities, the optimal price, and the equilibrium behavior via numerical examples
MAP/PH/1 systems with group service: performance analysis under diïŹerent admission strategies
2015 - 2016Recent advances in wireless communication networks led to possibility of multi-rate transmission of information. The queueing theory represents a valid tool to study how the performances of such communication systems can be improved, and to give proper solutions. Modeling a multi-rate transmission system, in terms of queueing theory, means that a particular discipline has to be considered: a group of requests from users can be processed simultaneously in parallel and processing of the whole group is supposed ïŹnished if processing of all individual requests belonging to this group is over. In order to model this typology of telecommunication systems, some particular assumption can be made on arrivals, which occur by a Markovian arrival process, and on service time and length of admission period, which are regulated by phase type distributions. Thus, in this thesis MAP/PH/1 queueing systems have been considered, with and without retrial to take into account all possible behaviours of the customers. The main goal of the research activity presented in this work is to introduce novel admission strategies for the described systems, in order to give a major contribute to the current performance analysys, in particular as regard the choice of the optimal length of admission period and optimal size of the groups. Dynamics of such systems are described by multidimensional Markov chains. Ergodicity condition for these Markov chains have been derived, stationary probability distribution of the states have been computed, formulas for the main performance measures of the system have been attained. Essential advantages of the proposed customerâs service disciplines have been numerically illustrated. [edited by author]I recenti progressi ottenuti per le reti di comunicazione wireless, permettono la trasmissione multi-frequenza delle informazioni. La teoria delle code rappresenta un valido strumento per studiare come le performance di tali sistemi di comunicazione possano essere migliorate, e individuare opportune soluzioni. In termini di teoria delle code, modellare un sistema di trasmissione multi-frequenza signiïŹca considerare una determinata disciplina: un gruppo di richieste da parte di utenti possono essere processate simultaneamente in parallelo, e il processo dellâintero gruppo risulta completato se tutte le richieste appartenenti a tale gruppo sono espletate. Al ïŹne di modellare tale tipologia di sistemi di telecomunicazione, si possono deïŹnire particolari assunzioni sugli arrivi, determinati da processi di arrivo Markoviani, e sul tempo di servizio e lunghezza del periodo di ammissione, regolati da distribuzioni di tipo a fasi. Pertanto, in tale lavoro di tesi sono stati considerati sistemi a coda di tipo MAP/PH/1, con e senza retrial per considerare tutti i possibili comportamenti degli utenti. Il principale obiettivo dellâattivita` di ricerca presentata in tale lavoro `e introdurre nuove strategie di ammissione per i sistemi descritti, al ïŹne di fornire un maggior contributo alle attuali analisi sulle performance, in particolare relativamente alla scelta della lunghezza ottimale del periodo di ammissione e la dimensione ottimale dei gruppi. Le dinamiche di tali sistemi sono descritte da catene di Markov multidimensionali. `E stata ricavata la condizione di ergodicit`a per tali catene di Markov, `e stata calcolata la distribuzione delle probabilita` stazionarie degli stati, e sono state ottenute le formule per le misure dei principali parametri prestazionali del sistema. I principali vantaggi delle discipline di servizio proposte sono state illustrate numericamente. [a cura dell'autore]XXIX n.s
On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys
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.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Linear retrial inventory system with second optional service under mixed priority service
The present paper deals with a generalization of the homogeneous single server finite source retrial inventory system with two classes of customers - one with high priority customer and the other with low priority customer. The inventory is replenished according to an (s, Q) policy and the replenishing times are assumed to be exponentially distributed. The server provides two types of services - one with essential service and the other with a second optional service. The service times of the 1st (essential) and 2nd (optional) services are independent and exponentially distributed. The high priority customers have a mixed priority over the low priority customers. Retrial is introduced for low priority customers only. The joint probability distribution of the number of customers in the waiting hall, the number of customers in the orbit and the inventory level is obtained for the steady state case. Some important system performance measures in the steady state are derived and the long-run total expected cost rate is also derived.Publisher's Versio