M A P + M A P M 2 N ∞ Queueing System with Absolute Priority and Reservation of Servers

Abstract EN

We consider a multiserver queueing system with an infinite buffer and two types of customers.

The flow of customers is described by two Markovian arrival processes (MAPs).

Type 1 customers have absolute priority over type 2 customers.

If the arriving type 1 customer encounters all servers busy, but some of them provide service to type 2 customers, service of one type 2 customer is terminated and type 1 customer occupies the released server.

To avoid too frequent termination of service of type 2 customers, we suggest reservation of some number of servers for type 1 customers.

Type 2 customers, who do not succeed to get a server upon arrival or are knocked out from a server, join the buffer or leave the system forever.

During a waiting period in the buffer, type 2 customers can be impatient and may leave the system forever.

The ergodicity condition of the system is derived in an analytically tractable form.

The stationary distribution of the system states and the main performance measures are calculated.

The Laplace-Stieltjes transform of the waiting time distribution of an arbitrary type 2 customer is derived.

Numerical examples are presented.

The problem of the optimal channel reservation is numerically solved.