Asymptotic analysis of highly reliable retrial queueing systems

Ankara : Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 2000.Thesis (Master's) -- Bilkent University, 2000.Includes bibliographical references leaves 66-71The thesis is concerned with the asymptotic analysis of the time of first loss of a customer and the flow of lost customers in some types of Markov retrial queueing systems with flnite buffer. A retrial queueing system is characterized by the following feature: an arriving customer finding all of the servers busy must leave the service area and join a special buffer. After this it may re-apply for service after some random time. If the buffer is full the customer is lost. The analysis of the time of first loss of a customer is based on the method of so-called S — sets and the results about the asymptotic behavior of the first exit time from the fixed subset of states of semi-Markov process of a special structure (so-called monotone structure). Single server retrial queueing systems [M IM IlIm with retrials) as well as multiple server retrial queueing systems {M IM fsfm with retrials) are analyzed in cases of fast service and both fast service and fast retrials. Exponential approximation for the time of first loss and Poisson approximation for the flow of lost customers are proved for all of the considered cases.Kurtuluş, MüminM.S

Asymptotic analysis of a heterogeneous multiprocessor system in a randomly changing environment

L