Sojourn time in an M/M/1 processor sharing queue with permanent customers

We explicitly compute the sojourn time distribution of an arbitrary customer in an M/M/1 processor sharing (PS) queue with permanent customers. We notably exhibit the orthogonal structure associated with this queuing system and we show how sieved Pollaczek polynomials and their associated orthogonality measure can be used to obtain an explicit representation for the complementary cumulative distribution function of the sojourn time of a customer. This explicit formula subsequently allows us to compute the two first moments of this random variable and to study the asymptotic behavior of its distribution. The most salient result is that the decay rate depends on the load of the system and the number K of permanent customers. When the load is above a certain threshold depending on K, the decay rate is identical to that of a regular M/M/1 PS queue.     

Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers

We consider a two-class processor sharing queueing system with impatient customers. The system operates under the discriminatory processor sharing (DPS) scheduling. The arrival process of each class customers is the Poisson process and the service requirement of a customer is exponentially distributed. The reneging rate of a customer is a constant. To analyze the performance of the system, we develop a time scale decomposition approach to approximate the joint queue-length distribution of each class customers. Via a numerical experiment, we show that the time scale decomposition approach gives a fairly good approximation of the queue-length distribution and the expected queue length.     

Large Deviations for Empirical Estimators of the Stationary Distribution of a Semi-Markov Process with Finite State Space

We prove the large deviation principle for empirical estimators of stationary distributions of semi-Markov processes with finite state space, irreducible embedded Markov chain, and finite mean sojourn time in each state. We consider on/off Gamma sojourn processes as an illustrative example, and, in particular, continuous time Markov chains with two states. In the second case, we compare the rate function in this article with the known rate function concerning another family of empirical estimators of the stationary distribution.     

Computational analysis of the queue with working breakdowns and delaying repair under a Bernoulli-schedule-controlled policy

This paper considers a single server queueing system with working breakdowns and delaying repair under a Bernoulli-schedule-controlled policy. At a breakdown instant, the system either goes to repair period immediately with probability p, or continues to provide auxiliary service for the current customers with probability q = 1 ? p. While the system resides in the auxiliary service period, it may go to repair period if there is no customer at the epoch of service completion or the occurrence of breakdown. By using the matrix analytic method and the spectral expansion method, we respectively obtain the steady state distribution to make the straightforward computation of performance measures and the Laplace-Stieltjes transform of the stationary sojourn time of an arbitrary customer. In addition, some numerical examples are presented to show the impact of parameters on the performance measures.     

Analysis of MAP/M/1 queue with working breakdowns

In this paper, we analyze the MAP/M/1 queue with working breakdowns. The number of customers in the system in the steady state is obtained by the matrix geometric solution method. Then, several useful performance measures are provided. Furthermore, we show a recursive formula to obtain an approximation of stationary sojourn time. At last, we present several numerical examples.     

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.     

ML and Bayes estimation in a two-phase tandem queue with a second optional service and random feedback

ABSTRACT

In this article, we consider a two-phase tandem queueing model with a second optional service and random feedback. The first phase of service is essential for all customers and after the completion of the first phase of service, any customer receives the second phase of service with probability α, feedback to the tail of the first queue with probability β if the service is not successful and leaves the system with probability 1 ? α ? β. In this model, our main purpose is to estimate the parameters of the model, traffic intensity, and mean system size, in the steady state, via maximum likelihood and Bayesian methods. Furthermore, we find asymptotic confidence intervals for mean system size. Finally, by a simulation study, we compute the confidence levels and mean length for asymptotic confidence intervals of mean system size with a nominal level 0.95.     

Performance analysis of the retrial queues with finite number of sources and service interruptions

This paper aims at presenting an analytic approach for investigating a single-server retrial queue with finite population of customers where the server is subject to interruptions. A free source may generate a primary call to request service. If the server is free upon arrival, the call starts to be served and the service times are independent, generally distributed random variables. During the service time the source cannot generate a new primary call. After service the source moves into the free state and can generate a new primary call. There is no waiting space in front of the server, and a call who finds the server unavailable upon arrival joins an orbit of unsatisfied customers. The server is subject to interruptions during the service processes. When the server is interrupted, the call being served just before server interruption goes to the retrial orbit and will retry its luck after a random amount of time until it finds the server available. The recovery times of the interrupted server are assumed to be generally distributed. Our analysis extends previous work on this topic and includes the analysis of the arriving customer’s distribution, the busy period, and the waiting time process.     

THE SOJOURN TIME DISTRIBUTION OF AN ALTERNATING RENEWAL PROCESS

Ordinary, modified, and equilibrium alternating renewal processes are defined in such a way that the distribution of the sojourn time in one state of a two-state system may be considered conditional on the starting state. The double Laplace transform of a non-negative stochastic process is also defined, and used to express a result of Takacs (1957) on sojourn time distributions.     

On the functional central limit theorem for first passage time of nonlinear semi-Markov reward processes

Abstract

In this article we examine the functional central limit theorem for the first passage time of reward processes defined over a finite state space semi-Markov process. In order to apply this process for a wider range of real-world applications, the reward functions, considered in this work, are assumed to have general forms instead of the constant rates reported in the other studies. We benefit from the martingale theory and Poisson equations to prove and establish the convergence of the first passage time of reward processes to a zero mean Brownian motion. Necessary conditions to derive the results presented in this article are the existence of variances for sojourn times in each state and second order integrability of reward functions with respect to the distribution of sojourn times. We finally verify the presented methodology through a numerical illustration.     

Simultaneous arrival of customers to two different queues and modeling dependence via copula approach

ABSTRACT

In classical queueing systems, a customer is allowed to wait only in one queue to receive the service. In practice, when there exist a number of queues rendering the same service, some customers may tend to simultaneously take turn in more than one queue with the aim to receive the service sooner and thus reduce their waiting time. In this article, we introduce such a model and put forward a methodology to deal with the situation. In this regard, we consider two queues and assume that if a customer, who has turn in both queues, receives the service from one of the queues, the other turn is automatically withdrawn. This circumstance for the model brings about some abandonment in each queue as some customers receive the service from the other one. We study the customer’s waiting time in the mentioned model, which is defined as the minimum of waiting times in both queues and obtain probability density function of this random variable. Our approach to obtain probability density function of each of the waiting time random variables is to rely on the existing results for the abandonment case. We examine the situation for the cases of independence and dependence of the waiting time random variables. The latter is treated via a copula approach.     

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.     

The Asymptotic Behavior of INAR (p) Models

An integer-valued autoregressive model with random time delay under random environment is presented. The geometric ergodicity of the iterative sequence determined by this new model is discussed. Moreover, sufficient conditions for stationarity and β-mixing property with exponential decay for the INAR model with random time delay under random environment are developed.     

Estimating Marginal Effects in Accelerated Failure Time Models for Serial Sojourn Times Among Repeated Events

Recurrent event data are commonly encountered in longitudinal studies when events occur repeatedly over time for each study subject. An accelerated failure time (AFT) model on the sojourn time between recurrent events is considered in this article. This model assumes that the covariate effect and the subject-specific frailty are additive on the logarithm of sojourn time, and the covariate effect maintains the same over distinct episodes, while the distributions of the frailty and the random error in the model are unspecified. With the ordinal nature of recurrent events, two scale transformations of the sojourn times are derived to construct semiparametric methods of log-rank type for estimating the marginal covariate effects in the model. The proposed estimation approaches/inference procedures also can be extended to the bivariate events, which alternate themselves over time. Examples and comparisons are presented to illustrate the performance of the proposed methods.     

Nonparametric estimator for the survival function of quality adjusted lifetime (QAL) in a three-state illness–death model

In this work, we consider nonparametric estimation of QAL distribution in a three-state illness–death model. In our approach, we first write down the expression for the distribution of QAL in terms of the joint distribution of the sojourn times in the three states. The estimate of the QAL distribution is obtained by substituting the estimates of sojourn time distributions in the expression of the QAL distribution. The proposed nonparametric estimate, assuming independence between time to illness and sojourn time in the state of illness, is uniformly consistent. Asymptotic normality has also been established. An estimate of asymptotic variance has been obtained. The performance of the proposed estimator is investigated by simulation. A data set of the Stanford Heart Transplant program has been analyzed for illustration.     

Count data and treatment heterogeneity in 2×2 crossover trials

Count data are routinely assumed to have a Poisson distribution, especially when there are no straightforward diagnostic procedures for checking this assumption. We reanalyse two data sets from crossover trials of treatments for angina pectoris , in which the outcomes are counts of anginal attacks. Standard analyses focus on treatment effects, averaged over subjects; we are also interested in the dispersion of these effects (treatment heterogeneity). We set up a log-Poisson model with random coefficients to estimate the distribution of the treatment effects and show that the analysis is very sensitive to the distributional assumption; the population variance of the treatment effects is confounded with the (variance) function that relates the conditional variance of the outcomes, given the subject's rate of attacks, to the conditional mean. Diagnostic model checks based on resampling from the fitted distribution indicate that the default choice of the Poisson distribution for the analysed data sets is poorly supported. We propose to augment the data sets with observations of the counts, made possibly outside the clinical setting, so that the conditional distribution of the counts could be established.     

Estimation of the Parameters of a Two-phase Tandem Queue with a Second Optional Service

In this article, we consider a two-phase tandem queueing model with a second optional service. In this model, the service is done by two phases. The first phase of service is essential for all customers and after the completion of the first phase of service, any customer receives the second phase of service with probability α, or leaves the system with probability 1 ? α. Also, there are two heterogeneous servers which work independently, one of them providing the first phase of service and the other a second phase of service. In this model, our main purpose is to estimate the parameters of the model, traffic intensity, and mean system size, in the steady state, via maximum likelihood and Bayesian methods. Furthermore, we find asymptotic confidence intervals for mean system size. Finally, by a simulation study, we compute the confidence levels and mean length for asymptotic confidence intervals of mean system size with a nominal level 0.95.     

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.