2011•Unpublished venueRequires access

Analysis of a single server batch Markovian arrival process with feedback

D. Arivudainambi, P. Godhandaraman

Abstract

In this paper, we consider a batch Markovian arrival process with feedback. The Markov chain embedded at service completion epochs are investigated. The stationary queue length distribution and loss probability are obtained. The effects of various performances are analyzed. They confirm importance of special treatment of the models with the batch Markovian arrival process (BMAP) and feedback. Feedback queues play an important role in real life service systems, where customers may require repeated services.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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

Key concepts: Markovian arrival process, Markov process, Computer science, Queue, Markov chain, Queueing theory, Process (computing), Real-time computing