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.     

Predictive event modelling in multicenter clinical trials with waiting time to response

A new analytic statistical technique for predictive event modeling in ongoing multicenter clinical trials with waiting time to response is developed. It allows for the predictive mean and predictive bounds for the number of events to be constructed over time, accounting for the newly recruited patients and patients already at risk in the trial, and for different recruitment scenarios. For modeling patient recruitment, an advanced Poisson-gamma model is used, which accounts for the variation in recruitment over time, the variation in recruitment rates between different centers and the opening or closing of some centers in the future. A few models for event appearance allowing for 'recurrence', 'death' and 'lost-to-follow-up' events and using finite Markov chains in continuous time are considered. To predict the number of future events over time for an ongoing trial at some interim time, the parameters of the recruitment and event models are estimated using current data and then the predictive recruitment rates in each center are adjusted using individual data and Bayesian re-estimation. For a typical scenario (continue to recruit during some time interval, then stop recruitment and wait until a particular number of events happens), the closed-form expressions for the predictive mean and predictive bounds of the number of events at any future time point are derived under the assumptions of Markovian behavior of the event progression. The technique is efficiently applied to modeling different scenarios for some ongoing oncology trials. Case studies are considered.     

Comparing waiting times in a multi-stage model: A log-rank approach

A proper log-rank test for comparing two waiting (i.e. sojourn, gap) times under right censored data has been absent in the survival literature. The classical log-rank test provides a biased comparison even under independent right censoring since the censoring induced on the time since state entry depends on the entry time unless the hazards are semi-Markov. We develop test statistics for comparing K waiting time distributions from a multi-stage model in which censoring and waiting times may be dependent upon the transition history in the multi-stage model. To account for such dependent censoring, the proposed test statistics utilize an inverse probability of censoring weighted (IPCW) approach previously employed to define estimators for the cumulative hazard and survival function for waiting times in multi-stage models. We develop the test statistics as analogues to K-sample log-rank statistics for failure time data, and weak convergence to a Gaussian limit is demonstrated. A simulation study demonstrates the appropriateness of the test statistics in designs that violate typical independence assumptions for multi-stage models, under which naive test statistics for failure time data perform poorly, and illustrates the superiority of the test under proportional hazards alternatives to a Mann–Whitney type test. We apply the test statistics to an existing data set of burn patients.     

Bayesian nonparametric survival analysis using mixture of Burr XII distributions

ABSTRACT

Recently, the Bayesian nonparametric approaches in survival studies attract much more attentions. Because of multimodality in survival data, the mixture models are very common. We introduce a Bayesian nonparametric mixture model with Burr distribution (Burr type XII) as the kernel. Since the Burr distribution shares good properties of common distributions on survival analysis, it has more flexibility than other distributions. By applying this model to simulated and real failure time datasets, we show the preference of this model and compare it with Dirichlet process mixture models with different kernels. The Markov chain Monte Carlo (MCMC) simulation methods to calculate the posterior distribution are used.     

Using panel methods to model waiting times for National Health Service surgery

Summary. Long waiting times for non-emergency (elective) procedures are a central feature of the UK's National Health Service, with about 1 million people waiting for surgery at any one time. This paper develops empirical models of the demand for and supply of elective surgery which simultaneously determine waiting times. The models are tested by using a panel of annual data for 5499 small areas from 1991 to 1998. Supply and demand functions are estimated for all specialties combined and for seven individual specialties, using panel data methods that incorporate simultaneously determined variables. The elasticity of demand with respect to waiting time varies between specialties but is always quite small. The results are discussed in the light of UK Government policy initiatives designed to reduce waiting times substantially. The analysis suggests that these initiatives will not stimulate demand markedly and therefore stand a good chance of succeeding provided that adequate additional resources are made available.     

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.     

Discrete time cold standby repairable system: Combinatorial analysis

ABSTRACT

In this article, we obtain exact expression for the distribution of the time to failure of discrete time cold standby repairable system under the classical assumptions that both working time and repair time of components are geometric. Our method is based on alternative representation of lifetime as a waiting time random variable on a binary sequence, and combinatorial arguments. Such an exact expression for the time to failure distribution is new in the literature. Furthermore, we obtain the probability generating function and the first two moments of the lifetime random variable.     

A joint modelling approach for clustered recurrent events and death events

In dental implant research studies, events such as implant complications including pain or infection may be observed recurrently before failure events, i.e. the death of implants. It is natural to assume that recurrent events and failure events are correlated to each other, since they happen on the same implant (subject) and complication times have strong effects on the implant survival time. On the other hand, each patient may have more than one implant. Therefore these recurrent events or failure events are clustered since implant complication times or failure times within the same patient (cluster) are likely to be correlated. The overall implant survival times and recurrent complication times are both interesting to us. In this paper, a joint modelling approach is proposed for modelling complication events and dental implant survival times simultaneously. The proposed method uses a frailty process to model the correlation within cluster and the correlation within subjects. We use Bayesian methods to obtain estimates of the parameters. Performance of the joint models are shown via simulation studies and data analysis.     

Optimal preventive policies for imperfect maintenance models with replacement first and last

ABSTRACT

This paper proposes preventive replacement policies for an operating system which may continuously works for N jobs with random working times and is imperfectly maintained upon failure. As a failure occurs, the system suffers one of the two types of failures based on some random mechanism: type-I (repairable or minor) failure is rectified by a minimal repair, or type-II (non repairable or catastrophic) failure is removed by a corrective replacement. A notation of preventive replacement last model is considered in which the system is replaced before any type-II failure at an operating time T or at number N of working times, whichever occurs last. Comparisons between such a preventive replacement last and the conventional replacement first are discussed in detail. For each model, the optimal schedule of preventive replacement that minimizes the mean cost rate is presented theoretically and determined numerically. Because the framework and analysis are general, the proposed models extend several existing results.     

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.     

Statistical Analysis of General Degradation Path Model and Failure Time Data with Multiple Failure Modes

ABSTRACT

This article considers degradation and failure time models with multiple failure modes which used to study the problem of longevity and aging in survival analysis and reliability. Degradation process is modeled using general nonparametric, nonlinear path models. Semi-parametric models for the intensities of the traumatic failures are used supposing that these intensities depend on degradation level. Semi-parametric estimators of various reliability characteristics are proposed and asymptotic properties of the estimators are obtained. The theoretical results are illustrated using simulated data.     

A Retrial Queue with a Constant Retrial Rate,Server Downs and Impatient Customers

ABSTRACT

In this paper, we consider a retrial queueing system consisting of a waiting line of infinite capacity in front of a single server subject to breakdowns. A customer upon arrival may join the queue (waiting line) or go to the retrial orbit (another queue) to retry for service after a random time. Only the customer at the head of the retrial orbit is allowed to retry for service. Upon retrial, the customer enters the service if the server is idle; otherwise, it may go back to the retrial orbit or leave the system (become impatient). All the interarrival times, service times, server up times, server down times and retrial times are exponential, and all the necessary independence conditions in these variables are assumed. For this system, we provide sufficient conditions under which, for any given number of customers in the orbit, the stationary probability of the number of customers in the waiting line decays geometrically. We also provide explicitly an expression for the decay parameter.     

Reliability Research of k-out-of-n: G Supply Chain System Based on Copula

Supply chain management has received considerable attention in the literature and it is meaningful and important to be able to measure the reliability of supply chains. In the article, the suppliers in the supply chain systems are not independent of each other and the dependency relation may be either linear or nonlinear correlation. From the view of the distribution service process, a copula-based method is proposed for analyzing the reliability of supply chains. In this article, by introducing the model of k-out-of-n: G system into the studies of supply chains, an evaluation method is suggested and the reliability indexes are obtained. Finally, a numerical example is presented to illustrate the results obtained in this article.     

An improper form of Weibull distribution for competing risks analysis with Bayesian approach

ABSTRACT

In survival analysis, individuals may fail due to multiple causes of failure called competing risks setting. Parametric models such as Weibull model are not improper that ignore the assumption of multiple failure times. In this study, a novel extension of Weibull distribution is proposed which is improper and then can incorporate to the competing risks framework. This model includes the original Weibull model before a pre-specified time point and an exponential form for the tail of the time axis. A Bayesian approach is used for parameter estimation. A simulation study is performed to evaluate the proposed model. The conducted simulation study showed identifiability and appropriate convergence of the proposed model. The proposed model and the 3-parameter Gompertz model, another improper parametric distribution, are fitted to the acute lymphoblastic leukemia dataset.     

A note on ‘curable’ shock processes

In most conventional shock models, the events caused by an external shock are initiated at the moments of its occurrence. Recently, Cha and Finkelstein (2012) had considered the case when each shock from a nonhomogeneous Poisson processes can trigger a failure of a system not immediately, as in the classical shock models, but with delay of some random time. In this paper, we suggest the new type of shock models, where each delayed failure can be cured (repaired) with certain probabilities. These shock processes have not been considered in the literature before. We derive and analyze the corresponding survival and failure rate functions and consider a meaningful reliability example of the stress–strength model.     

The use of simple reparameterizations to improve the efficiency of Markov chain Monte Carlo estimation for multilevel models with applications to discrete time survival models

Summary.  We consider the application of Markov chain Monte Carlo (MCMC) estimation methods to random-effects models and in particular the family of discrete time survival models. Survival models can be used in many situations in the medical and social sciences and we illustrate their use through two examples that differ in terms of both substantive area and data structure. A multilevel discrete time survival analysis involves expanding the data set so that the model can be cast as a standard multilevel binary response model. For such models it has been shown that MCMC methods have advantages in terms of reducing estimate bias. However, the data expansion results in very large data sets for which MCMC estimation is often slow and can produce chains that exhibit poor mixing. Any way of improving the mixing will result in both speeding up the methods and more confidence in the estimates that are produced. The MCMC methodological literature is full of alternative algorithms designed to improve mixing of chains and we describe three reparameterization techniques that are easy to implement in available software. We consider two examples of multilevel survival analysis: incidence of mastitis in dairy cattle and contraceptive use dynamics in Indonesia. For each application we show where the reparameterization techniques can be used and assess their performance.     

Joint modeling of degradation and failure time data

This paper surveys some approaches to model the relationship between failure time data and covariate data like internal degradation and external environmental processes. These models which reflect the dependency between system state and system reliability include threshold models and hazard-based models. In particular, we consider the class of degradation–threshold–shock models (DTS models) in which failure is due to the competing causes of degradation and trauma. For this class of reliability models we express the failure time in terms of degradation and covariates. We compute the survival function of the resulting failure time and derive the likelihood function for the joint observation of failure times and degradation data at discrete times. We consider a special class of DTS models where degradation is modeled by a process with stationary independent increments and related to external covariates through a random time scale and extend this model class to repairable items by a marked point process approach. The proposed model class provides a rich conceptual framework for the study of degradation–failure issues.     

Flowgraph Models for Generalized Phase Type Distributions Having Non-Exponential Waiting Times

ABSTRACT. Aalen (1995) introduced phase type distributions based on Markov processes for modelling disease progression in survival analysis. For tractability and to maintain the Markov property, these use exponential waiting times for transitions between states. This article extends the work of Aalen (1995) by generalizing these models to semi-Markov processes with non-exponential waiting times. The generalization allows more realistic modelling of the stages of a disease where the Markov property and exponential waiting times may not hold. Flowgraph models are introduced to provide a closed form for the distributions in situations involving non-exponential waiting times. Flowgraph models work where traditional methods of stochastic processes are intractable. Saddlepoint approximations are used in the analysis. Together, generalized phase type distributions, flowgraphs, and saddlepoint approximations create exciting and innovative prospects for the analysis of survival data.     

Multi-state Models: A Review

Multi-state models are models for a process, for example describing a life history of an individual, which at any time occupies one of a few possible states. This can describe several possible events for a single individual, or the dependence between several individuals. The events are the transitions between the states. This class of models allows for an extremely flexible approach that can model almost any kind of longitudinal failure time data. This is particularly relevant for modeling different events, which have an event-related dependence, like occurrence of disease changing the risk of death. It can also model paired data. It is useful for recurrent events, but has limitations. The Markov models stand out as much simpler than other models from a probability point of view, and this simplifies the likelihood evaluation. However, in many cases, the Markov models do not fit satisfactorily, and happily, it is reasonably simple to study non-Markov models, in particular the Markov extension models. This also makes it possible to consider, whether the dependence is of short-term or long-term nature. Applications include the effect of heart transplantation on the mortality and the mortality among Danish twins.     

NONPARAMETRIC STATISTICAL ANALYSIS OF DISCRETE-TIME QUEUES,WITH APPLICATIONS TO ATM TELETRAFFIC DATA

In this paper nonparametric statistical analysis of a discrete-time queueing system is considered. Estimation of performance measures of the system is studied. The attention is first focused on the estimation of the waiting time probability distribution, as well as of functionals of interest (mean waiting time, variance of the waiting time, etc.). The approach is based on the estimation of the corresponding generating function. Attention is paid to the estimation of the probability of a “long delay”, in view of its importance for applications. Results for possibly unstable models are also obtained. Finally, an application to ATM teletraffic data is provided.