Stationary analysis of a BMAP/R/1 queue with R-type multiple working vacations

We consider an infinite-buffer single server queue with batch Markovian arrival process (BMAP) and exhaustive service discipline under multiple working vacation policy. The service time during a working vacation is generally distributed random variable which is independent of the service times during a normal busy period as well as the arrival process. Duration of service times during a normal busy period and duration of working vacation times follow the class of distributions whose Laplace-Stieltjes transforms are rational functions (R-type distributions). The service time during a normal busy period, working vacation time, and the service time during a working vacation are independent of each other as well as of the arrival process. If a working vacation terminates while service is going on for a customer at head of the queue in vacation mode then, the server switches to normal mode and the customer at head of the queue is entitled to receive a full service time in the normal busy period irrespective of the amount of service received by the customer at head of the queue during the previous working vacation period. We obtain system-length distributions at various epoch, such as post-departure, pre-arrival, arbitrary, and pre-service. The proposed analysis is based on the use of matrix-analytic procedure to obtain system-length distribution at post-departure epoch. Later, we use supplementary variable technique and simple algebraic manipulations to obtain system-length distribution at arbitrary epoch using the system-length distribution at post-departure epoch. Some important performance measures, such as mean system lengths and mean waiting time have been obtained. Finally, some numerical results have been presented in the form of tables and graphs to show the applicability of the results obtained in this article. The model has potential application in areas of computer and communication networks, such as ethernet passive optical network (EPON).     

Subexponential asymptotics of the waiting time distribution in a single-server queue with multiple Markovian arrival streams

This paper considers subexponential asymptotics of the tail distributions of waiting times in stationary work-conserving single-server queues with multiple Markovian arrival streams, where all arrival streams are modulated by the underlying Markov chain with finite states and service time distributions may differ for different arrival streams. Under the assumption that the equilibrium distribution of the overall (i.e., customer-average) service time distribution is subexponential, a subexponential asymptotic formula is first shown for the virtual waiting time distribution, using a closed formula recently found by the author. Further when customers are served on a FIFO basis, the actual waiting time and sojourn time distributions of customers from respective arrival streams are shown to have the same asymptotics as the virtual waiting time distribution.     

Analysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival Streams

This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of customers may be different for different arrival streams. After briefly discussing the actual waiting time distributions of customers from respective arrival streams, we derive a formula for the vector generating function of the time-average joint queue length distribution in terms of the virtual waiting time distribution. Further assuming the discrete phase-type batch size distributions, we develop a numerically feasible procedure to compute the joint queue length distribution. Some numerical examples are provided also.     

On Level Crossing Analysis of Queues

In this note we introduce a new level crossing analysis and using it derive an integral equation for the steady state waiting time in the GI/G/1 Queue. For the GI/M/1 queue we derive the rates of up- and down-crossings of the virtual delay process and two integral equations, one for the steady state time spent in the system and the other for the steady state waiting time in the queue. Also, the steady state probability distributions of the time spent in the system and the waiting time in the queue are obtained by solving these integral equations.     

ANALYSIS OF A GI/G Y /1 SYSTEM IN DISCRETE-TIME

ABSTRACT

We consider a class of single server queueing systems in which customers arrive singly and service is provided in batches, depending on the number of customers waiting when the server becomes free. Service is independent of the batch size. This system could also be considered as a batch service queue in which a server visits the queue at arbitrary times and collects a batch of waiting customers for service, or waits for a customer to arrive if there are no waiting customers. A waiting server immediately collects and processes the first arriving customer. The system is considered in discrete time. The interarrival times of customers and the inter-visit times of the server, which we call the service time, have general distributions and are represented as remaining time Markov chains. We analyze this system using the matrix-geometric method and show that the resulting R matrix can be determined explicitly in some special cases and the stationary distributions are known semi-explicitly in some other special cases.     

AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITY M/PH/1 QUEUE

This paper considers a single server queue that handles arrivals from N classes of customers on a non-preemptive priority basis. Each of the N classes of customers features arrivals from a Poisson process at rate λ _i and class-dependent phase type service. To analyze the queue length and waiting time processes of this queue, we derive a matrix geometric solution for the stationary distribution of the underlying Markov chain. A defining characteristic of the paper is the fact that the number of distinct states represented within the sub-level is countably infinite, rather than finite as is usually assumed. Among the results we obtain in the two-priority case are tractable algorithms for the computation of both the joint distribution for the number of customers present and the marginal distribution of low-priority customers, and an explicit solution for the marginal distribution of the number of high-priority customers. This explicit solution can be expressed completely in terms of the arrival rates and parameters of the two service time distributions. These results are followed by algorithms for the stationary waiting time distributions for high- and low-priority customers. We then address the case of an arbitrary number of priority classes, which we solve by relating it to an equivalent three-priority queue. Numerical examples are also presented.     

A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times

Abstract

We consider the cyclic polling system with two queues. One queue is severed according to the exhaustive discipline, and the other queue is served according to the 1‐limited discipline. At least one of the service and/or switchover times has a regularly varying tail. We obtain the tail behavior of the waiting time distributions. When one of the service and/or switchover times has an infinite second moment, we derive the heavy‐traffic behavior of the waiting time distribution at the 1‐limited queue.     

Multi-class M/PH/1 queues with deterministic impatience times

This article considers computational procedures for the waiting time and queue length distributions in stationary multi-class first-come, first-served single-server queues with deterministic impatience times. There are several classes of customers, which are distinguished by deterministic impatience times (i.e., maximum allowable waiting times). We assume that customers in each class arrive according to an independent Poisson process and a single server serves customers on a first-come, first-served basis. Service times of customers in each class are independent and identically distributed according to a phase-type distribution that may differ for different classes. We first consider the stationary distribution of the virtual waiting time and then derive numerically feasible formulas for the actual waiting time distribution and loss probability. We also analyze the joint queue length distribution and provide an algorithmic procedure for computing the probability mass function of the stationary joint queue length.     

BMAP/G/1 Queue Under D-Policy: Queue Length Analysis

ABSTRACT

We study the queue length distribution of a queueing system with BMAP arrivals under D-policy. The idle server begins to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We derive the vector generating functions of the queue lengths both at a departure and at an arbitrary point of time. Mean queue lengths are derived and a numerical example is presented.     

Queue Length Analysis of MAP/G/1 Queue Under D-Policy

Abstract

We study the queue length distribution of a queueing system with MAP arrivals under D-policy. The idle server begins to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We derive the vector generating functions of the queue lengths both at a departure and at an arbitrary point of time. Mean queue lengths will be derived from these transform results. A numerical example is provided.     

Workload Process,Waiting Times,and Sojourn Times in a Discrete Time MMAP[K]/SM[K]/1/FCFS Queue

Abstract

In this paper, we study the total workload process and waiting times in a queueing system with multiple types of customers and a first-come-first-served service discipline. An M/G/1 type Markov chain, which is closely related to the total workload in the queueing system, is constructed. A method is developed for computing the steady state distribution of that Markov chain. Using that steady state distribution, the distributions of total workload, batch waiting times, and waiting times of individual types of customers are obtained. Compared to the GI/M/1 and QBD approaches for waiting times and sojourn times in discrete time queues, the dimension of the matrix blocks involved in the M/G/1 approach can be significantly smaller.     

Estimation of R=P[Y<X] for three-parameter generalized Rayleigh distribution

Surles and Padgett [Inference for reliability and stress–strength for a scaled Burr type X distribution. Lifetime Data Anal. 2001;7:187–200] introduced a two-parameter Burr-type X distribution, which can be described as a generalized Rayleigh distribution. In this paper, we consider the estimation of the stress–strength parameter R=P[Y<X], when X and Y are both three-parameter generalized Rayleigh distributions with the same scale and locations parameters but different shape parameters. It is assumed that they are independently distributed. It is observed that the maximum-likelihood estimators (MLEs) do not exist, and we propose a modified MLE of R. We obtain the asymptotic distribution of the modified MLE of R, and it can be used to construct the asymptotic confidence interval of R. We also propose the Bayes estimate of R and the construction of the associated credible interval based on importance sampling technique. Analysis of two real data sets, (i) simulated and (ii) real, have been performed for illustrative purposes.     

Slow convergence of the Gibbs sampler

We consider the Gibbs sampler as a tool for generating an absolutely continuous probability measure ≥ on R^d. When an appropriate irreducibility condition is satisfied, the Gibbs Markov chain (X_n;n ≥ 0) converges in total variation to its target distribution ≥. Sufficient conditions for geometric convergence have been given by various authors. Here we illustrate, by means of simple examples, how slow the convergence can be. In particular, we show that given a sequence of positive numbers decreasing to zero, say (b_n;n ≥ 1), one can construct an absolutely continuous probability measure ≥ on R^d which is such that the total variation distance between ≥ and the distribution of X_n, converges to 0 at a rate slower than that of the sequence (b_n;n ≥ 1). This can even be done in such a way that ≥ is the uniform distribution over a bounded connected open subset of R^d. Our results extend to hit-and-run samplers with direction distributions having supports with symmetric gaps.     

A study of R2 measure under the accelerated failure time models

For right-censored data, the accelerated failure time (AFT) model is an alternative to the commonly used proportional hazards regression model. It is a linear model for the (log-transformed) outcome of interest, and is particularly useful for censored outcomes that are not time-to-event, such as laboratory measurements. We provide a general and easily computable definition of the R² measure of explained variation under the AFT model for right-censored data. We study its behavior under different censoring scenarios and under different error distributions; in particular, we also study its robustness when the parametric error distribution is misspecified. Based on Monte Carlo investigation results, we recommend the log-normal distribution as a robust error distribution to be used in practice for the parametric AFT model, when the R² measure is of interest. We apply our methodology to an alcohol consumption during pregnancy data set from Ukraine.     

Inference of R=P[X<Y] for generalized logistic distribution

This paper deals with the estimation of R=P[X<Y] when X and Y come from two independent generalized logistic distributions with different parameters. The maximum-likelihood estimator (MLE) and its asymptotic distribution are proposed. The asymptotic distribution is used to construct an asymptotic confidence interval of R. Assuming that the common scale parameter is known, the MLE, uniformly minimum variance unbiased estimator, Bayes estimation and confidence interval of R are obtained. The MLE of R, asymptotic distribution of R in the general case, is also discussed. Monte Carlo simulations are performed to compare the different proposed methods. Analysis of a real data set has also been presented for illustrative purposes.     

A two phases queueing system with Bernoulli vacation schedule under multiple vacation policy

This paper deals with a single server Poisson arrival queue with two phases of heterogeneous service along with a Bernoulli schedule vacation model, where after two successive phases service the server either goes for a vacation with probability p (0≤p≤1) or may continue to serve the next unit, if any, with probability q(=1−p). Further the concept of multiple vacation policy is also introduced here. We obtained the queue size distributions at a departure epoch and at a random epoch, Laplace Stieltjes Transform of the waiting time distribution and busy period distribution along with some mean performance measures. Finally we discuss some statistical inference related issues.     

Approximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis

Abstract

We propose a method to approximate the transient performance measures of a discrete time queueing system via a steady state analysis. The main idea is to approximate the system state at time slot t or on the n-th arrival–-depending on whether we are studying the transient queue length or waiting time distribution–-by the system state after a negative binomially distributed number of slots or arrivals. By increasing the number of phases k of the negative binomial distribution, an accurate approximation of the transient distribution of interest can be obtained.

In order to efficiently obtain the system state after a negative binomially distributed number of slots or arrivals, we introduce so-called reset Markov chains, by inserting reset events into the evolution of the queueing system under consideration. When computing the steady state vector of such a reset Markov chain, we exploit the block triangular block Toeplitz structure of the transition matrices involved and we directly obtain the approximation from its steady state vector. The concept of the reset Markov chains can be applied to a broad class of queueing systems and is demonstrated in full detail on a discrete-time queue with Markovian arrivals and phase-type services (i.e., the D-MAP/PH/1 queue). We focus on the queue length distribution at time t and the waiting time distribution of the n-th customer. Other distributions, e.g., the amount of work left behind by the n-th customer, that can be acquired in a similar way, are briefly touched upon.

Using various numerical examples, it is shown that the method provides good to excellent approximations at low computational costs–-as opposed to a recursive algorithm or a numerical inversion of the Laplace transform or generating function involved–-offering new perspectives to the transient analysis of practical queueing systems.     

Approximation Multivariate Distribution with Pair Copula Using the Orthonormal Polynomial and Legendre Multiwavelets Basis Functions

We concentrate on constructing higher dimensional distributions using a fast growing graphical model called Vine/ pair-copula model which has been introduced and developed by Joe, Cooke, Bedford, Kurowica, Daneshkhah, and others. They first construct a n-dimensional copula density by stacking together n(n ? 1)/2 bivariate copula density, and they then approximate arbitrarily well these bivariate copulas and the corresponding multivariate distribution using a semi-parametric method. One constructive approach involves the use of minimum information copulas that can be specified to any required degree of precision based on the available data (or possibly based on the experts’ judgments). By using this method, one is able to use a fixed finite dimensional family of copulas to be employed in terms of a vine construction, with the promise of a uniform level of approximation.

The basic idea behind this method is to use a two-dimensional ordinary polynomial series to approximate any log-density of a bivariate copula function by truncating the series at an appropriate point. We make this approximation method more accurate and computationally faster by using the orthonormal polynomial and Legendre multiwavelets (LMW) series as the basis functions. We show the derived approximations are more precise and computationally faster with better properties than the one proposed previous method in the literature. We then apply our method to modeling a dataset of Norwegian financial data that was previously analyzed in the series of articles, and finally compare our results by them. At the end, we present a method to simulate from the approximated models, and validate our approximation using the simulation results to recover the same dependency structure of the original data.     

Improved R and s control charts for monitoring the process variance

The Shewhart R control chart and s control chart are widely used to monitor shifts in the process spread. One fact is that the distributions of the range and sample standard deviation are highly skewed. Therefore, the R chart and s chart neither provide an in-control average run length (ARL) of approximately 370 nor guarantee the desired type I error of 0.0027. Another disadvantage of these two charts is their failure in detecting an improvement in the process variability. In order to overcome these shortcomings, we propose the improved R chart (IRC) and s chart (ISC) with accurate approximation of the control limits by using cumulative distribution functions of the sample range and standard deviation. Simulation studies show that the IRC and ISC perform very well. We also compare the type II error risks and ARLs of the IRC and ISC and found that the s chart is generally more efficient than the R chart. Examples are given to illustrate the use of the developed charts.     

Explicit formulae and convergence rate for the system M α /G/1/N as N→∞

The paper deals with the system M ^α /G/1/N with a finite number of waiting places in which arrivals can occur in a group. The number of customers in the line and the virtual waiting time are studied both in the transient and in the stationary regime. Special attention is paid to the stationary distributions of these functionals as N→∞. The number of customers lost during a busy period is considered as well.