On A Multiserver Finite Buffer Queue With Impatient

In this paper we study a multiserver finite buffer queue in which customers have an stochastic deadline of phase-type until the beginning of their service. The following service disciplines are considered: FCFS (First-Come First-Served), LCFS (Last-Come First-Served) and SIRO (Service In Random Order) along with a parameterizable probabilistic push-out mechanism. Although this model has many applications in the general area of telecommunications as well as in other disciplines, it was primarily motivated by the study of handoff priority schemes in mobile cellular networks. The analysis of the system is performed using a matrix analytic approach and we obtain performance measures such as probabilities of blocking, expulsion and abandonment as well as the sojourn time distribution in different system conditions