We analyze the output process of finite capacity birth-death Markovian queues. We develop a formula for the asymptotic variance rate of the form + vi where is the rate of outputs...
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
Consider a system (e.g. a computer farm or a call center) operating as a M/M/c queue, where c = 1, or 1 < c < ∞, or c = ∞. The system as a whole suffers disastrous break...
We consider an extension of the standard G/G/1 queue, described by the equation W D = max{0, B − A + Y W}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model red...
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get serv...