In this paper, we study the discrete-time MAP/PH/1 queue with multiple working vacations and finite buffer N. Using the Matrix-Geometric Combination method, we ...

A discrete MAP/PH/1 queue is a queue having the Markovian arrival process (MAP) and a single server with phase-type (PH-type) distributed service time. The ...

This paper treats a discrete-time single-server finite-buffer exhaustive (single- and multiple-) vacation queueing system with discrete-time Markovian ...

In view of these, to fill the gap in the present literature, in this paper we study a continuous time finite capacity single server queue where arrivals occur ...

A single‐server queue in which the server goes through alternating periods of vacation and work is analysed and the problem is reduced to a ...

Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on ...

This paper treats a discrete-time single-server finite-buffer exhaustive (single- and multiple-) vacation queueing system with discrete-time Markovian ...

This paper analyzes a finite buffer single server batch service ($a, b)$ queue with general input and Markovian service process ($MSP$). The server accesses new ...

Oct 19, 2020 · The service time is independent on the batch size. First, we employ the classical embedded Markov renewal process approach to study the model.

Jul 6, 2015 · This paper analyzes a finite buffer size discrete-time Geo/G/1/N queue with multiple working vacations and different input rate.