2007Asia Pacific Journal of Operational ResearchRequires access

A BMAP/PH/N SYSTEM WITH IMPATIENT REPEATED CALLS

Valentina Klimenok, Dmitry S. Orlovsky, Alexander Dudin

Open publisher page 28 citations

Abstract

A multi-server queueing model with a Batch Markovian Arrival Process, phase-type service time distribution and impatient repeated customers is analyzed. After any unsuccessful attempt, the repeated customer leaves the system with the fixed probability. The behavior of the system is described in terms of continuous time multi-dimensional Markov chain. Stability condition and an algorithm for calculating the stationary state distribution of this Markov chain are obtained. Main performance measures of the system are calculated. Numerical results are presented.

About this research paper

What this paper is about

A multi-server queueing model with a Batch Markovian Arrival Process, phase-type service time distribution and impatient repeated customers is analyzed. After any unsuccessful attempt, the repeated customer leaves the system with the fixed probability. The behavior of the system is described in terms of continuous time multi-dimensional Markov chain. Stability condition and an algorithm for calculating the stationary state distribution of this Markov chain are obtained. Main performance measures of the system are calculated. Numerical results are presented.

Why it matters

OpenAlex reports 28 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A multi-server queueing model with a Batch Markovian Arrival Process, phase-type service time distribution and impatient repeated customers is analyzed. After any unsuccessful attempt, the repeated customer leaves the system with the fixed probability. The behavior of the system is described in terms of continuous time multi-dimensional Markov chain. Stability condition and an algorithm for calculating the stationary state distribution of this Markov chain are obtained. Main performance measures of the system are calculated. Numerical results are presented.

Key concepts: Markovian arrival process, Markov chain, Stationary distribution, Markov process, Queueing theory, Computer science, Stability (learning theory), Phase-type distribution

Related papers

Back to paper searchBrowse research topicsOriginal source
A BMAP/PH/N SYSTEM WITH IMPATIENT REPEATED CALLS — Research Paper | ScholarLens