Single-server Finite-buffer Queue Research Articles

Analysis of single server finite buffer queue under discouraged arrival and retention of reneging

Queuing models where arrival rates go down consequent to increase in the number of customers are called systems with discouraged arrivals. Discouraged arrivals are distinct from balking in the sense that balking implies that arriving customers do not join. In this paper, we model a single server finite buffer Markovian queuing model with discouraged arrival, balking, reneging and retention of reneged customers. The steady state probabilities are obtained using Markov process method. Closed form expression of traditional as well as some freshly designed performance measures are presented. We also perform sensitivity analysis to examine the variations in performance measures with the variations in system parameters. Our results are numerically illustrated through a field level problem with design connotations.

On the Inter-Departure Times in <inline-formula> <tex-math notation="LaTeX">$M/\widetilde{D}/1/{B}_{on}$ </tex-math> </inline-formula> Queue With Queue-Length Dependent Service and Deterministic/Exponential Vacations

We derive the distribution of inter-departure times of a finite-buffer single-server queue with Poisson arrival process and queue-length-dependent service times, where the server goes to vacation if either the queue is emptied or a limited number $(R_{1})$ of packets are served, whichever occurs first, in the current busy period. We consider two types of vacation distributions: 1) deterministic and 2) exponential. Queue-length distribution at embedded points is derived first, then, the distribution and variance of inter-departure times are derived, for both types of vacations. The simulation results are in good agreement with the derived analytical results. The above framework would be useful at the receiver in modeling and analyzing the jitter and the waiting time of time-division multiplexing (TDM) emulated packets in TDM over packet-switched network (TDM over PSN) technology as a function of a buffer size.

Efficient computational analysis of non-exhaustive service vacation queues: BMAP/R/1/N(∞) under gated-limited discipline

• A finite-buffer vacation queue with batch Markovian arrival process has been analyzed. • The server is subjected to serve under gated-limited service discipline. • Proposed analysis is based on the successive substitution and the supplementary variable method. • The results have been matched with the corresponding infinite-buffer queue. • Numerical results are presented for different service- and vacation-time distributions. This paper analyzes the finite-buffer single server queue with vacation(s). It is assumed that the arrivals follow a batch Markovian arrival process ( BMAP ) and the server serves customers according to a non-exhaustive type gated-limited service discipline. It has been also considered that the service and vacation distributions possess rational Laplace-Stieltjes transformation (LST) as these types of distributions may approximate many other distributions appeared in queueing literature. Among several batch acceptance/rejection strategies, the partial batch acceptance strategy is discussed in this paper. The service limit L (1 ≤ L ≤ N ) is considered to be fixed, where N is the buffer-capacity excluding the one in service. It is assumed that in each busy period the server continues to serve until either L customers out of those that were waiting at the start of the busy period are served or the queue empties, whichever occurs first. The queue-length distribution at vacation termination/service completion epochs is determined by solving a set of linear simultaneous equations . The successive substitution method is used in the steady-state equations embedded at vacation termination/service completion epochs. The distribution of the queue-length at an arbitrary epoch has been obtained using the supplementary variable technique. The queue-length distributions at pre-arrival and post-departure epoch are also obtained. The results of the corresponding infinite-buffer queueing model have been analyzed briefly and matched with the previous model. Net profit function per unit of time is derived and an optimal service limit and buffer-capacity are obtained from a maximal expected profit. Some numerical results are presented in tabular and graphical forms.

Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP/G/1/N With or Without Vacation(s)

We consider a finite-buffer single-server queue with batch Markovian arrival process. In the case of finite-buffer batch arrival queue, there are different customer rejection/acceptance strategies such as partial batch rejection, total batch rejection, and total batch acceptance policy. We consider partial batch rejection strategy throughout our paper. We obtain queue length distributions at various epochs such as pre-arrival, arbitrary, and post-departure as well as some important performance measures, like probability of loss for the first, an arbitrary, and the last customer of a batch, mean queue lengths, and mean waiting times. The corresponding queueing model under single and multiple vacation policy has also been investigated. Some numerical results have been presented in the form of tables by considering phase-type and Pareto service time distributions. The proposed analysis is based on the successive substitutions in the Markov chain equations of the queue-length distribution at an embedded post-departure epoch of a customer. We also establish relationships among the queue-length distributions at post-departure, arbitrary, and pre-arrival epochs using the classical argument based on Markov renewal theory and semi-Markov processes. Such queueing systems find applications in the performance evaluation of teletraffic part in 4G A11-IP networks.

Algorithm for computing the queue length distribution at various time epochs in DMAP/G(1, a, b)/1/N queue with batch-size-dependent service time

Abstract This paper presents a discrete-time single-server finite-buffer queue with Markovian arrival process and generally distributed batch-size-dependent service time. Given that infinite service time is not commonly encountered in practical situations, we suppose that the distribution of the service time has a finite support. Recently, a similar continuous-time system with Poisson input process was discussed by Banerjee and Gupta (2012). But unfortunately, their method is hard to apply in the analysis of discrete-time case with versatile Markovian point process due to the fact that the difference equation governing the boundary state probabilities is more complex than the continuous one. If we follow their ideas, we will eventually find that some important joint queue length distributions cannot be computed and thus some key performance measures cannot be derived. In this paper, replacing the finite support renewal distribution with an appropriate phase-type distribution, the joint state probabilities at various time epochs (arbitrary, pre-arrival and departure) have been obtained by using matrix analytic method and embedded Markov chain technique. Furthermore, UL-type RG-factorization is employed in numerical computation of block-structured Markov chains with finitely-many levels. Some numerical examples are presented to demonstrate the feasibility of the proposed algorithm for several service time distributions. Moreover, the impact of the correlation factor on loss probability and mean sojourn time is also investigated.

Analysis of a discrete-time working vacation queue with balking

This paper investigates a discrete-time single server finite buffer queue with single working vacation wherein the customers decide either to join the queue or balk. The inter-arrival times, service times and vacation times are assumed to be independent and geometrically distributed. Using matrix method, the steady-state probabilities are obtained. Various performance measures of the model and average sojourn time are presented. An optimization problem is considered using particle swarm optimization (PSO) through a cost function. Further, maximum likelihood estimate (MLE) for the balking parameter is obtained. Numerical results are presented in the form of tables and graphs to show the effect of parameters on the system performance.

Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control

We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of L customers has been served. Depending on the number of customers present in the system, the server will monitor his vacation times. Queue-length distributions at various epochs such as before, arrival, arbitrary and after, departure have been obtained. Several other service disciplines like Bernoulli scheduling, nonexhaustive service, and E-limited service can be treated as special cases of the P-limited service. Finally, the total expected cost function per unit time is considered to determine locally optimal values N* of N or a maximum limit L^* of L^ as the number of customers served during a service period at a minimum cost.

Analysis of finite buffer renewal input queue with balking and multiple working vacations

This paper analyzes a finite buffer single server queueing system with multiple working vacations in which customers balk (i.e., refuse to join the queue). The inter-arrival times and service times during regular busy period are, respectively, arbitrarily and exponentially distributed. Vacation times and service times during vacation are exponentially distributed. Using embedded Markov chain and supplementary variable techniques, we obtain the system length distributions at pre-arrival and arbitrary epochs. Various performance measures of the model, waiting time analysis and some special cases are also presented. Finally, a variety of numerical results in the form of tables and graphs are discussed.

Analysis of finite-buffer bulk-arrival bulk-service queue with variable service capacity and batch-size-dependent service: M<SUP align="right">X</SUP>/G<span style="position:relative; top:-5px;left:0px;">Y</span><span style="position:relative;top:2px;left:-5px;margin-left:0px;margin-bottom:10px;">r</span>/1/N

Over the past few decades, bulk-arrival bulk-service queues have found wide application in several areas including computer-communication and telecommunication systems. In this paper, we consider a single server finite-buffer queue where customers arrive in batches according to the compound Poisson process and are served in batches of variable service capacity. The service times of the batches are arbitrarily distributed and depend on the size of the batch taken into for service. We obtain the joint distribution of the number of customers in the queue and number with the server, and other distributions such as number of customers in the queue, in the system, and number with the server. Various performance measures such as average number of customers in the system (queue), with the server, blocking probabilities, etc. are obtained. Several numerical results are presented and comparative studies of batch-size-dependent service with the one when service time of the batches are independent of the size of the batch have been carried out.

TAIL ASYMPTOTICS FOR CUMULATIVE PROCESSES SAMPLED AT HEAVY-TAILED RANDOM TIMES WITH APPLICATIONS TO QUEUEING MODELS IN MARKOVIAN ENVIRONMENTS

This paper considers the tail asymptotics for a cumulative process {B(t);t ≥ 0} sampled at a heavy-tailed random time T. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality P(B(T ) >b x) ∼ P(M (T ) >b x) ∼ P( T> x )a sx →∞ ,w hereM (t )= sup0≤u≤t B(u )a ndb is a certain positive constant. The main results of this paper can be used to obtain the subexponential asymptotics for various queueing models in Markovian environments. As an example, using the main results, we derive subexponential asymptotic formulas for the loss probability of a single-server finite-buffer queue with an on/off arrival process in a Markovian environment.

Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service

In the design and analysis of any queueing system, one of the main objectives is to reduce congestion which can be achieved by controlling either arrival-rates or service-rates. This paper adopts the latter approach and analyzes a single-server finite-buffer queue where customers arrive according to the Poisson process and are served in batches of minimum size a with a maximum threshold limit b . The service times of the batches are arbitrarily distributed and depends on the size of the batches undergoing service. We obtain the joint distribution of the number of customers in the queue and the number with the server, and distributions of the number of customers in the queue, in the system, and the number with the server. Various performance measures such as the average number of customers in the queue (system) and with the server etc. are obtained. Several numerical results are presented in the form of tables and graphs and it is observed that batch-size-dependent service rule is more effective in reducing the congestion as compared to the one when service rates of the batches remain same irrespective of the size of the batch. This model has potential application in manufacturing, computer-communication network, telecommunication systems and group testing.

New results on bulk service queue with finite-buffer: M/G (a,b)/1/N

We consider a single-server finite-buffer queue with general bulk service rule where customers arrive according to a Poisson process and service times of the batches are arbitrarily distributed. Using the embedded Markov chain technique we first obtain the steady-state joint distribution of the number of customers in the queue and number with the departing batch at departure-epoch. Further in order to obtain the joint distribution of the number of customers in the queue and number with the server at arbitrary-epoch, we develop relations between arbitrary- and departure-epoch probabilities. Finally, we also obtain the distributions of number of customers in the queue (system), and number with the server. Various performance measures of interest such as average number of customers in the queue (system) and average number of customers with the server etc. are obtained. The model was earlier discussed by Gold and Tran-Gia (Queueing Syst 14:413–426, 1993) and Chaudhry and Gupta (Queueing Syst 31:95–100, 1999) wherein they first obtained the distribution of the number of customers in the queue at departure-epoch without taking into the consideration of the size of the departing batch. Then they obtained the distribution of the number of customers in the queue at arbitrary-epoch when server is idle/busy.

Loss pattern of DBMAP/DMSP/1/ K queue and its application in wireless local communications

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 service process is correlated and its structure is presented through discrete-time Markovian service process (DMSP). The bursty nature of packet loss pattern will be examined by means of statistics with respect to alternating loss periods and loss distances. The loss period is the period that loss once it starts; loss distance refers to the spacing between the loss periods. All of the two related performance measurement are derived, including probability distributions of a loss period and a loss distance, average length of a loss period and a loss distance. Queueing systems of this type arise in the domain of wireless local communications. Based on the numerical analysis of such a queueing system, some performance measures for the wireless local communication are presented.

Performance analysis of discrete-time GI/D-MSP<SUP align=right>a;b</SUP>/1/N queue

This paper presents a discrete-time single-server finite buffer queue with renewal input and discrete Markovian service process (D-MSP) where server serves customers in batches according to general batch service rule. Using the supplementary variable and the imbedded Markov chain techniques, we obtain the queue-length distributions at pre-arrival and arbitrary epochs. Some performance measures such as loss probability, mean queue length and mean waiting time in the queue along with some numerical results have also been discussed.

Discrete-time batch service GI/Geo#47;1#47;N queue with accessible and non-accessible batches

Discrete-time queues are extensively used in modelling the asynchronous transfer mode environment at cell level. In this paper, we consider a discrete-time single-server finite-buffer queue with general inter-arrival and geometric service times where the services are performed in accessible or non-accessible batches of maximum size b with a minimum threshold value a. We provide a recursive method, using the supplementary variable technique and treating the remaining inter-arrival time as the supplementary variable, to develop the steady-state queue/system length distributions at pre-arrival and arbitrary epochs under the early arrival system. The method is depicted analytically for geometrical and deterministic inter-arrival time distributions, respectively. Various performance measures and outside observer's observation epochs are also discussed. Finally, some computational results have been presented.

Queueing analysis and optimal control of [formula omitted] and [formula omitted] systems

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 ‘ b’ with a minimum threshold size ‘ a’. The service time of each batch follows general distribution independent of each other as well as the arrival process. We obtain queue length distributions at various epochs such as, pre-arrival, arbitrary, departure, etc. Some important performance measures, like mean queue length, mean waiting time, probability of blocking, etc. have been obtained. Total expected cost function per unit time is also derived to determine the optimal value N ∗ of N at a minimum cost for given values of a and b. Secondly, we consider a finite-buffer single server queue where arrivals occur according to BMAP and service process in this case follows a non-renewal one, namely, Markovian service process ( MSP ) . Server serves customers according to general bulk service rule as described above. We derive queue length distributions and important performance measures as above. Such queueing systems find applications in the performance analysis of communication, manufacturing and transportation systems.

On the Finite Buffer Queue with Renewal Input and Batch Markovian Service Process: GI/BMSP/1/N

We consider a finite-buffer single-server queue with renewal input where the service is provided in batches of random size according to batch Markovian service process (BMSP). Steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs have been obtained along with some important performance measures. The model has potential applications in the areas of computer networks, telecommunication systems, and manufacturing systems, etc.

Finite Buffer Vacation Queue under E-limited with Limit Variation Service and Batch Markovian Arrival Process

We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at various epochs such as, pre-arrival, arbitrary, departure etc. have been obtained. Several other service disciplines like, Bernoulli scheduling, non-exhaustive service and E-limited service can be treated as special cases of the ELV service. Such a queueing system finds applications in the token ring or token bus of local area network (LAN) in which the vacation would correspond to the time the token is away to the other stations.

The analysis of a finite-buffer general input queue with batch arrival and exponential multiple vacations

Vacation queueing models have wide range of application in several areas including computer-communication, and manufacturing systems. A finite-buffer single-server queue with renewal input and multiple exponential vacations has been analysed by Karaesmen and Gupta (1996). In this paper we extend the analysis to cover the batch arrivals, i.e. we consider a batch arrival single-server queue with renewal input and multiple exponential vacations. Using the imbedded Markov chain and supplementary variable techniques we obtain steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs. The Laplace-Stieltjes transforms of the actual waiting-time distribution of the first-, arbitrary- and last-customer of a batch under First-Come-First-Serve discipline have been derived. Finally, we present useful performance measures of interest such as probability of blocking, average queue (system) length. Some tables and graphs showing the effect of model parameters on key performance measures are presented.

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 correlated and its structure is presented through Markovian service process (MSP). The model is analyzed for two possible customer rejection strategies: partial batch rejection and total batch rejection policy. We obtain steady-state distribution at pre-arrival and arbitrary epochs along with some important performance measures, like probabilities of blocking the first, an arbitrary, and the last customer of a batch, average number of customers in the system, and the mean waiting times in the system. Some numerical results have been presented graphically to show the effect of model parameters on the performance measures. The model has potential application in the area of computer networks, telecommunication systems, manufacturing system design, etc.