This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
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...
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously pr...
This paper considers an infinite-server queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival strea...
We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue ex...