Single Server Batch Arrival Retrial Queueing Models

Abstract

Retrial queues are characterized by the feature that the arriving customer who find the server busy or down will join the orbit to try his luck again after sometime Such queueing models are widely used in tele communication and telephone switching systems They are used as mathematical models of computer systems newlineThe main objective of the present work is to study batch arrival retrial queueing models with different parameters The content of the thesis is given in seven chapters An introduction to queueing systems and literature review is presented A two phase batch newlinearrival retrial queue with admission control feedback and vacation is analysed in chapter two Each individual customer in a batch is subject to control admission policy upon arrival If the newlineserver is idle one of the admitted customers enter the service immediately and the rest join the orbit otherwise all the admitted customers enter the orbit All the customers demand the first newlineessential service whereas only some of them opt for second optional service After completion of essential or optional service if the customer is dissatisfied with the service he may join the orbit as newlinea feedback customer After completion of the optional service the server may go for a single vacation or remain idle in the system The retrial times service times and vacation times are assumed to be follow general distributions In chapter three a batch arrival retrial queue with multi optional second phase impatient customers Bernoulli vacation and orbital search is considered Customers arrive in batches according to Poisson process Customers are allowed to balk and renege at particular times All the customers demand the first essential service while only some of them demand the second multi optional service After each service the server may take a single Bernoulli vacation After vacation completion the server searches for customers in the orbit or remains idle