Computing conditional sojourn time of a randomly chosen tagged customer in a 
                $$\textit{BMAP/MSP/}1$$
                
                    
                        
                            BMAP
                            /
                            MSP
                            /
                            1
                        
                    
                
             queue under random order service discipline

Ghosh, Souvik; Banik, Abhijit Datta

doi:10.1007/s10479-017-2534-z

Cited by 5 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is a positive function which satisfies 0 < nf (n) ≤ C for all n(≥ 1) and C is a positive constant. The conditional sojourn time of a randomly chosen tagged customer in a BM AP/M SP/1 − ROS (Random order Service) queueing system is studied in Ghosh et al [6]. Sandhya et al [20] analyze a BM AP/BM SP/1 queue with randomly varying environment where the environment changes as per changes in a continuous time Markov chain and derive stationary queue length probabilities and other performance measures for the same.…”

Section: Highlights Of This Paper Arementioning

confidence: 99%

A $ {BMAP/BMSP/1} $ queue with Markov dependent arrival and Markov dependent service batches

Krishnamoorthy¹,

Joshua²

2021

JIMO

View full text Add to dashboard Cite

Batch arrival and batch service queueing systems are of importance in the context of telecommunication networks. None of the work reported so far consider the dependence of consecutive arrival and service batches. Batch Markovian Arrival Process(BM AP ) and Batch Markovian Service Process (BM SP ) 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 restrict 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. Further, successive inter-arrival and service time durations are also assumed to be correlated. Specifically, we consider a BM AP/BM SP/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.

show abstract

Section: Highlights Of This Paper Arementioning

confidence: 99%