Search

In a G/GI/c loss system with balking, reneging, or limited waiting space, deleting some of the arriving customers can either increase or decrease the fraction of the remaining arrivals who get served, depending on how customers are deleted. We present a model in which the random deletion of arrivals independently and with some fixed probability can never decrease the fraction of the remaining arrivals who get served. [ABSTRACT FROM AUTHOR]

Considers a multiarmed bandit problem. Solutions to the problem; Proof of the theorem used to solve the problem.

Characterizes losses during busy periods in multiple-server finite-buffer systems with batch Poisson arrivals. Analysis of single-server queue with batch arrivals and general services; Results for the number of losses in multiple servers.

Presents a study on the use of coupling methods to show that the feedback flow of customers returning to the back of the queue converges to a Poisson process as the feedback delay distribution is scaled up. Approximations of waiting time in the setting of Poisson arrivals; Proof of coupling of a highway traffic result.