this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP=G=1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...

In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP/G/1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discrete Markovian service process. The server terminates service whenever the system becomes empty, and recommences service as soon as the number of waiting customers in the queue is N . We obtain the system-length distributions at prearrival and arbitrary epochs using the supplement...

This paper treats a discrete-time single-server finite-buffer exhaustive (singleand multiple-) vacation queueing system with discrete-time Markovian arrival process (D-MAP). The service and vacation times are generally distributed random variables and their durations are integral multiples of a slot duration. We obtain the queue-length distributions at departure, service completion, vacation te...

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prea...

in recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. in the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. in this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (oopls) us...