The MAP/PH/N retrial queue in a random environment

We consider the MAP/PH/N retrial queue with a finite number of sources operating in a finite state Markovian random environment. Two different types of multi-dimensional Markov chains are investigated describing the behavior of the system based on state space arrangements. The special features of the two formulations are discussed. The algorithms for calculating the stationary state probabilities are elaborated, based on which the main performance measures are obtained, and numerical examples are presented as well.     

Exponential and Strong Ergodicity for Markov Processes with an Application to Queues

For an ergodic continuous-time Markov process with a particular state in its space,the authors provide the necessary and sufficient conditions for exponential and strong ergodicity in terms of the moments of the first hitting time on the state.An application to the queue length process of M/G/1 queue with multiple vacations is given.     

A batch arrival retrial queue with two phases of service and Bernoulli vacation schedule

We consider an M X /G/1 queueing system with two phases of heterogeneous service and Bernoulli vacation schedule which operate under a linear retrial policy. In addition, each individual customer is subject to a control admission policy upon the arrival. This model generalizes both the classical M/G/1 retrial queue with arrivals in batches and a two phase batch arrival queue with a single vacation under Bernoulli vacation schedule. We will carry out an extensive stationary analysis of the system , including existence of the stationary regime, embedded Markov chain, steady state distribution of the server state and number of customer in the retrial group, stochastic decomposition and calculation of the first moment.     

Ergodic degrees for continuous-time Markov chains

This paper studies the existence of the higher orders deviation matrices for continuous time Markov chains by the moments for the hitting times. An estimate of the polynomial convergence rates for the transition matrix to the stationary measure is obtained. Finally, the explicit formulas for birth-death processes are presented.     

Asymptotic Inference in the Random Coefficient Autoregressive Model with Time-functional Variance Noises

This paper considers the random coefficient autoregressive model with time-functional variance noises, hereafter the RCA-TFV model. We first establish the consistency and asymptotic normality of the conditional least squares estimator for the constant coefficient. The semiparametric least squares estimator for the variance of the random coefficient and the nonparametric estimator for the variance function are constructed,and their asymptotic results are reported. A simulation study is presented ...     

Determining a Class of Markov Chains by Hitting Time

1 IntroductionIn many practical problems we often cannot observe the behavior of all states for a Markov chain (see [3-5]). A natural question is that from the observable data of a part of states, can one still obtain all statistical characteristics of the Markov chains. In this paper we give the positive answer for this question and prove the surprising result that the transition rate matrix of the birth-death chains with reflecting barriers and Markov chains on a star graph can be uniquely …     

M/G/1 QUEUE WITH CONTROLLABLE VACATIONS AND OPTIMIZATION OF VACATION POLICY

We introduce the control parameter N in a common queue M/G/1 with vacations; the endof a global vacation period is controlled by the parameter N. Thia extension for a queue withvacations is of significance in certain practical cases. In this paper, we find various transient andsteady-state results for the queue size. the delay times and the waiting times for the M/G/1 queuewith controllable vacations. Finally, we also discuss optimal selection of the control parameter.     

Algebraic convergence for discrete-time ergodic markov chains

This paper studies the l-ergodicity for discrete-time recurrent Markov chains.It proves that thel-order deviation matrix exists and is finite if and only if the chain is(l+2)-ergodic,and then the algebraicdecay rates of the n-step transition probability to the stationary distribution are obtained.The criteria forl-ergodicity are given in terms of existence of solution to an equation.The main results are,illustrated by someexamples.     

Asymptotic expansions of backward equations for two-time-scale Markov chains in continuous time

This work develops asymptotic expansions for solutions of systems of backward equations of time- inhomogeneous Maxkov chains in continuous time. Owing to the rapid progress in technology and the increasing complexity in modeling, the underlying Maxkov chains often have large state spaces, which make the computa- tional tasks ihfeasible. To reduce the complexity, two-time-scale formulations are used. By introducing a small parameter ε〉 0 and using suitable decomposition and aggregation procedures, it is formulated as a singular perturbation problem. Both Markov chains having recurrent states only and Maxkov chains including also tran- sient states are treated. Under certain weak irreducibility and smoothness conditions of the generators, the desired asymptotic expansions axe constructed. Then error bounds are obtained.     

Decay parameter and related properties of n-type branching processes

We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions for n-type Markov branching processes on the basis of the 1-type Markov branching processes and 2-type Markov branching processes. Investigating such behavior is crucial in realizing life period of branching models. In this paper, some important properties of the generating functions for n-type Markov branching q-matrix are firstly investigated in detail. The exact value of the decay parameter λC of such model is given for the communicating class C = Zn+ \ 0. It is shown that this λC can be directly obtained from the generating functions of the corresponding q-matrix. Moreover, the λC -invariant measures/vectors and quasi-distributions of such processes are deeply considered. λC -invariant measures and quasi-stationary distributions for the process on C are presented.     

Poisson’s equation for discrete-time single-birth processes

We consider Poisson’s equation for discrete-time single-birth processes, and we derive its solutions by solving a linear system of infinitely many equations. We apply the solution of Poisson’s equation to obtain the asymptotic variance. The results are further applied to birth–death processes and the scalar-valued GI/M/1-type Markov chains.     

Asymptotic behavior of the loss probability for an M/G/1/N queue with vacations

In this paper, asymptotic properties of the loss probability are considered for an M/G/1/N queue with server vacations and exhaustive service discipline, denoted by an M/G/1/N-(V, E)-queue. Exact asymptotic rates of the loss probability are obtained for the cases in which the traffic intensity is smaller than, equal to and greater than one, respectively. When the vacation time is zero, the model considered degenerates to the standard M/G/1/N queue. For this standard queueing model, our analysis provides new or extended asymptotic results for the loss probability. In terms of the duality relationship between the M/G/1/N and GI/M/1/N queues, we also provide asymptotic properties for the standard GI/M/1/N model.     

The GI/M/1 queue with exponential vacations

In this paper, we give a detailed analysis of the GI/M/1 queue with exhaustive service and multiple exponential vacation. We express the transition matrix of the imbedded Markov chain as a block-Jacobi form and give a matrix-geometric solution. The probability distribution of the queue length at arrival epochs is derived and is shown to decompose into the distribution of the sum of two independent random variables. In addition, we discuss the limiting behavior of the continuous time queue length processes and obtain the probability distributions for the waiting time and the busy period.     

GI/G/1排队系统队长的强大数定律和中心极限定理

本文首先证明当服务强度小于1时,GI/G/1排队系统的队长是一个特殊的马尔可夫骨架过程——正常返的Doob骨架过程,然后运用马尔可夫骨架过程的强大数定律和中心极限定理等重要结果,给出了队长的累积过程的期望和方差,并给出了该累积过程满足强大数定律和中心极限定理的充分条件。     

A heavy-traffic-limit formula for the moments of the stationary distribution in GI/G/1-type Markov chains

This paper studies the heavy-traffic limit of the moments of the stationary distribution in GI/G/1-type Markov chains. For these Markov chains, several researchers have derived heavy-traffic-limit formulas for the stationary distribution itself. However, for its moments, no such formulas have been reported in the literature. This paper presents a heavy-traffic-limit formula for the moments of the stationary distribution and a sufficient condition for the formula to hold, by using a characteristic function approach.     

Analysis of the GI/Geo/1 Queue with Disasters

The occurrence of disasters to a queueing system causes all customers to be removed if any are present. Although there has been much research on continuous-time queues with disasters, the discrete-time Geo/Geo/1 queue with disasters has appeared in the literature only recently. We extend this Geo/Geo/1 queue to the GI/Geo/1 queue. We present the probability generating function of the stationary queue length and sojourn time for the GI/Geo/1 queue. In addition, we convert our results into the Geo/Geo/1 queue and the GI/M/1 queue.     

A Markov-modulated M/G/1 queue II: Busy period and time for buffer overflow

We consider an M/G/1 queue where the arrival and service processes are modulated by a two state Markov chain. We assume that the arrival rate, service time density and the rates at which the Markov chain switches its state, are functions of the total unfinished work (buffer content) in the queue. We compute asymptotic approximations to performance measures such as the mean residual busy period, mean length of a busy period, and the mean time to reach capacity.This research was supported in part by NSF Grants DMS-84-06110, DMS-85-01535 and DMS-86-20267, and grants from the U.S. Israel Binational Science Foundation and the Israel Academy of Sciences.     

带单重指数工作休假和休假中断的GI／M／1的排队系统

本文主要研究带有单重指数工作休假和休假中断策略的GI／M／1排队模型。利用分块矩阵表示出嵌入马尔可夫链的转移矩阵,并运用矩阵几何解的方法求得到达时刻队长的稳态分布,而且证明了其可以分解为三个独立随机变量的分布的和。     

Analysis of the M/G/1 queue with exponentially working vacations—a matrix analytic approach

In this paper, an M/G/1 queue with exponentially working vacations is analyzed. This queueing system is modeled as a two-dimensional embedded Markov chain which has an M/G/1-type transition probability matrix. Using the matrix analytic method, we obtain the distribution for the stationary queue length at departure epochs. Then, based on the classical vacation decomposition in the M/G/1 queue, we derive a conditional stochastic decomposition result. The joint distribution for the stationary queue length and service status at the arbitrary epoch is also obtained by analyzing the semi-Markov process. Furthermore, we provide the stationary waiting time and busy period analysis. Finally, several special cases and numerical examples are presented.     

具有随机N—策略的M／G／1排队系统

本文讨论具有随机N-策略的M/G/1排队系统,采用向量Markov过程方法得到该系统有关的排队指标。上述结果可以看作是普通的和N-策略的M/G/1排队系统的推广。