Analysis of discrete time retrial queues with variant arrivals unreliable server and different vacation policies

Abstract

Classical queueing model is an effective tool to study congestion and newlinedelay in waiting lines. Retrial queue, a special type of queueing system, is newlineinitiated to deal blocked customers /reattempts which is not allowed in classical newlinequeueing models. Retrial queueing systems have been found beneficial in newlinemodelling many systems such as repeated calls of telephone switching systems, newlinetransmission of a packet in computer networks and collision avoidance in local newlinearea networks. Retrial queuing systems are identified by the following feature: newlinean arriving customer, on finding the server busy, departs from the service area newlineand joins the group, called orbit in order to acquire its service at a later stage. For newlineanalyzing the fields of queueing and telecommunications, discrete-time queues newlineare better than their continuous-time counterparts. The entire focus of this newlinedissertation is on the analytical study of discrete-time retrial queuing models newlinewith various patterns of arrivals and different types of vacations that fits with newlinemany real-world scenarios. newlineThe dissertation begins with an newline