A comprehensive study on the queue-size distribution in a finite-buffer system with a general independent input flow
WM Kempa - Performance Evaluation, 2017 - Elsevier
Abstract A finite-buffer GI/M/1/N− type queueing model is considered. The explicit formula for
the Laplace transform of the transient queue-size distribution, conditioned by the number of …
the Laplace transform of the transient queue-size distribution, conditioned by the number of …
[HTML][HTML] Performance evaluation of a multi-product production line: An approximation method
F Jarrahi, W Abdul-Kader - Applied Mathematical Modelling, 2015 - Elsevier
This paper develops an analytical method to measure the performance of a multi-product
unreliable production line with finite buffers between workstations. The performance …
unreliable production line with finite buffers between workstations. The performance …
Analysis of B M A P/M S P/1 Queue
SK Samanta, ML Chaudhry, A Pacheco - Methodology and Computing in …, 2016 - Springer
The analysis for the BMAP/MSP/1 queueing system is based on roots of the associated
characteristic equation of the vector-generating function of system-length distribution at …
characteristic equation of the vector-generating function of system-length distribution at …
Single server queues with a batch Markovian arrival process and bulk renewal or non-renewal service
AD Banik - Journal of Systems Science and Systems Engineering, 2015 - Springer
We first consider an infinite-buffer single server queue where arrivals occur according to a
batch Markovian arrival process (BMAP). The server serves customers in batches of …
batch Markovian arrival process (BMAP). The server serves customers in batches of …
Analytically explicit results for the GI/C-MSP/1/∞ queueing system using roots
ML Chaudhry, SK Samanta… - Probability in the …, 2012 - cambridge.org
In this paper, we present (in terms of roots) a simple closed-form analysis for evaluating
system-length distribution at prearrival epochs of the GI/C-MSP/1 queue. The proposed …
system-length distribution at prearrival epochs of the GI/C-MSP/1 queue. The proposed …
A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: -
We consider a batch arrival infinite-buffer single-server queue with generally distributed inter-
batch arrival times with arrivals occurring in batches of random sizes. The service process is …
batch arrival times with arrivals occurring in batches of random sizes. The service process is …
Queueing analysis and optimal control of BMAP/G (a, b)/1/N and BMAP/MSP (a, b)/1/N systems
AD Banik - Computers & Industrial Engineering, 2009 - Elsevier
We first consider a finite-buffer single server queue where arrivals occur according to batch
Markovian arrival process (BMAP). The server serves customers in batches of maximum size …
Markovian arrival process (BMAP). The server serves customers in batches of maximum size …
A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: -
We consider an infinite-buffer single-server queue with renewal input and Markovian service
process where customers are served in batches according to a general bulk service rule …
process where customers are served in batches according to a general bulk service rule …
[HTML][HTML] Loss pattern of DBMAP/DMSP/1/K queue and its application in wireless local communications
YC Wang, JH Chou, SY Wang - Applied Mathematical Modelling, 2011 - Elsevier
This paper applies a matrix-analytical approach to analyze the packet loss pattern of finite
buffer single server queue with discrete-time batch Markovian arrival process (DBMAP). The …
buffer single server queue with discrete-time batch Markovian arrival process (DBMAP). The …
Analyzing the finite buffer batch arrival queue under Markovian service process: GI X /MSP/1/N
We consider a batch arrival finite buffer single server queue with inter-batch arrival times are
generally distributed and arrivals occur in batches of random size. The service process is …
generally distributed and arrivals occur in batches of random size. The service process is …