We consider a general QBD process as defining a FIFO queue and obtain the stationary distribution of the sojourn time of a customer in that queue as a matrix exponential distribut...
Abstract Many models for customers impatience in queueing systems have been studied in the past; the source of impatience has always been taken to be either a long wait already exp...
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...
The Discriminatory Processor Sharing (DPS) model is a multi-class generalization of the egalitarian Processor Sharing model. In the DPS model all jobs present in the system are se...
Eitan Altman, Konstantin Avrachenkov, Urtzi Ayesta
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...