A BMAP/BMSP/1 Queue with Markov Dependent Arrival and Markov Dependent Service Batches

13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Batch arrival and batch service queueing systems are of impor-tance in the context of telecommunication networks. None of the work re-ported so far consider the dependence of consecutive arrival and service batches. Batch Markovian Arrival Process(BMAP) and Batch Markovian Service Pro-cess (BMSP) take care of the dependence between successive inter-arrival and service times, respectively. However in real life situations dependence between consecutive arrival and service batch sizes also play an important role. This is to regulate the workload of the server in the context of service and to re-strict the arrival batch size when the flow is from the same source. In this paper we study a queueing system with Markov dependent arrival and service batch sizes. The arrival and service batch sizes are assumed to be finite. Fur-ther, successive inter-arrival and service time durations are also assumed to be correlated. Specifically, we consider a BMAP/BMSP/1 queue with Markov dependent arrival and Markov dependent service batch sizes. The stability of the system is investigated. The steady state probability vectors of the system state and some important performance measures are computed. The Laplace-Stieltjes transform of waiting time and idle time of the server are obtained. Some numerical examples are provided.

Cite

CITATION STYLE

APA

Krishnamoorthy, A., & Joshua, A. N. (2021). A BMAP/BMSP/1 Queue with Markov Dependent Arrival and Markov Dependent Service Batches. Journal of Industrial and Management Optimization, 17(5), 2925–2941. https://doi.org/10.3934/jimo.2020101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free