排队系统的渐近泊松话务过程

在文中,我们首先给出由马氏过程的一些跳跃时刻形成的简单点过程的有限维分布族弱收敛到泊松过程的相应分布族的条件,并讨论了有限维分布族弱收敛到泊松过程相应分布族的平稳马氏排队系统的话务过程,其次,我们证明了ＧＩ／Ｍ／１排队系统的离去过程的有限维分布族在重话务的情况下弱收敛到泊松过程的相应分布族。     

高负荷下非强占优先排队网络系统中队长过程的扩散逼近

本文是在高负荷下非强占优先排除网络系统中给出了队长过程的扩散逼近 .证明了其队长过程的扩散极限是半鞅反射的布朗运动 .     

Global fluctuations in general Dyson’s Brownian motion

We consider a system of diffusing particles on the real line in a quadratic external potential and with a logarithmic interaction potential. The empirical measure process is known to converge weakly to a deterministic measure-valued process as the number of particles tends to infinity. Provided the initial fluctuations are small, the rescaled linear statistics of the empirical measure process converge in distribution to a Gaussian limit for sufficiently smooth test functions. For a large class of analytic test functions, we derive explicit general formulae for the mean and covariance in this central limit theorem by analyzing a partial differential equation characterizing the limiting fluctuations.     

Propriétés asymptotiques d'un estimateur dans un modèle non linéaire à effets mixtes

We propose an estimator of nonlinear mixed effects model's parameters, obtained by maximization of simulated pseudo likelihood. This simulated criterion is constructed from the likelihood of a Gaussian model whose means and variances are given by Monte Carlo approximations of means and variances of the true model. If the number of experimental units and the sample size of Monte Carlo simulations are respectively-denoted by N and K, we obtain the strong consistency and asymptotic normality of the estimator when N tends to infinity and the ratio √N/K tends to zero.     

抢占型优先服务机制下多类排队网络的扩散逼近

证明一个满负荷交通极限定理以证实在抢占型优先服务机制下多类排队网络的扩散逼近,进而为该系统提供有效的随机动力学模型．所研究的排队网络典型地出现在现代通讯系统中高速集成服务分组数据网络,其中包含分组数据包的若干交通类型,每个类型涉及若干工作处理类（步骤）,并且属于同一交通类型的工作在可能接受服务的每一个网站被赋予相同的优先权等级,更进一步地,在整个网络中,属于不同交通类型的分组数据包之间无交互路由．     

Weak limits of random coefficient autoregressive processes and their application in ruin theory

We prove that a large class of discrete-time insurance surplus processes converge weakly to a generalized Ornstein–Uhlenbeck process, under a suitable re-normalization and when the time-step goes to 0. Motivated by ruin theory, we use this result to obtain approximations for the moments, the ultimate ruin probability and the discounted penalty function of the discrete-time process.     

The Wigner semi-circle law and eigenvalues of matrix-valued diffusions

Summary A system of stochastic differential equations for the eigenvalues of a symmetric matrix whose components are independent Ornstein-Uhlenbeck processes is derived. This corresponds to a diffusion model of an interacting particles system with linear drift towards the origin and electrostatic inter-particle repulsion. The associated empirical distribution of particles is shown to converge weakly (as the number of particles tends to infinity) to a limiting measure-valued process which may be characterized as the weak solution of a deterministic ODE. The Wigner semi-circle density is found to be one of the equilibrium points of this limiting equation.     

Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse

Certain diffusion processes known as semimartingale reflecting Brownian motions (SRBMs) have been shown to approximate many single class and some multiclass open queueing networks under conditions of heavy traffic. While it is known that not all multiclass networks with feedback can be approximated in heavy traffic by SRBMs, one of the outstanding challenges in contemporary research on queueing networks is to identify broad categories of networks that can be so approximated and to prove a heavy traffic limit theorem justifying the approximation. In this paper, general sufficient conditions are given under which a heavy traffic limit theorem holds for open multiclass queueing networks with head-of-the-line (HL) service disciplines, which, in particular, require that service within each class is on a first-in-first-out (FIFO) basis. The two main conditions that need to be verified are that (a) the reflection matrix for the SRBM is well defined and completely- S, and (b) a form of state space collapse holds. A result of Dai and Harrison shows that condition (a) holds for FIFO networks of Kelly type and their proof is extended here to cover networks with the HLPPS (head-of-the-line proportional processor sharing) service discipline. In a companion work, Bramson shows that a multiplicative form of state space collapse holds for these two families of networks. These results, when combined with the main theorem of this paper, yield new heavy traffic limit theorems for FIFO networks of Kelly type and networks with the HLPPS service discipline. This revised version was published online in June 2006 with corrections to the Cover Date.     

Multiscale diffusion approximations for stochastic networks in heavy traffic

Stochastic networks with time varying arrival and service rates and routing structure are studied. Time variations are governed by, in addition to the state of the system, two independent finite state Markov processes X and Y. The transition times of X are significantly smaller than typical inter-arrival and processing times whereas the reverse is true for the Markov process Y. By introducing a suitable scaling parameter one can model such a system using a hierarchy of time scales. Diffusion approximations for such multiscale systems are established under a suitable heavy traffic condition. In particular, it is shown that, under certain conditions, properly normalized buffer content processes converge weakly to a reflected diffusion. The drift and diffusion coefficients of this limit model are functions of the state process, the invariant distribution of X, and a finite state Markov process which is independent of the driving Brownian motion.     

A reflected fBm limit for fluid models with ON/OFF sources under heavy traffic

We consider a family of non-deterministic fluid models that can be approximated under heavy traffic conditions by a multidimensional reflected fractional Brownian motion (rfBm). Specifically, we prove a heavy traffic limit theorem for multi-station fluid models with feedback and non-deterministic arrival process generated by a large enough number of heavy tailed ON/OFF sources, say N$N$. Scaling in time by a factor r$r$ and in state space conveniently, and letting N$N$ and r$r$ approach infinity (in this order) we prove that the scaled immediate workload process converges in some sense to a rfBm.     

Extreme and high-level sojourns of the single server queue in heavy traffic

This study characterizes the behavior of large queue lengths in heavy traffic. We show that the distribution of the maximum queue length in a random time interval for a queueing systems in heavy traffic converges to a novel extreme value distribution. We also study the processes that record the times that the queue length exceeds a high level and the cumulative time the queue is above the level. We show that these processes converge in distribution to compound Poisson processes. This revised version was published online in June 2006 with corrections to the Cover Date.     

A heavy-traffic analysis of a closed queueing system with a GI/∞ service center

This paper studies the heavy-traffic behavior of a closed system consisting of two service stations. The first station is an infinite server and the second is a single server whose service rate depends on the size of the queue at the station. We consider the regime when both the number of customers, n, and the service rate at the single-server station go to infinity while the service rate at the infinite-server station is held fixed. We show that, as n→∞, the process of the number of customers at the infinite-server station normalized by n converges in probability to a deterministic function satisfying a Volterra integral equation. The deviations of the normalized queue from its deterministic limit multiplied by √n converge in distribution to the solution of a stochastic Volterra equation. The proof uses a new approach to studying infinite-server queues in heavy traffic whose main novelty is to express the number of customers at the infinite server as a time-space integral with respect to a time-changed sequential empirical process. This gives a new insight into the structure of the limit processes and makes the end results easy to interpret. Also the approach allows us to give a version of the classical heavy-traffic limit theorem for the G/GI/∞ queue which, in particular, reconciles the limits obtained earlier by Iglehart and Borovkov. This revised version was published online in June 2006 with corrections to the Cover Date.     

Convergence of a queueing system in heavy traffic with general patience-time distributions

We analyze a sequence of single-server queueing systems with impatient customers in heavy traffic. Our state process is the offered waiting time, and the customer arrival process has a state dependent intensity. Service times and customer patient-times are independent; i.i.d. with general distributions subject to mild constraints. We establish the heavy traffic approximation for the scaled offered waiting time process and obtain a diffusion process as the heavy traffic limit. The drift coefficient of this limiting diffusion is influenced by the sequence of patience-time distributions in a non-linear fashion. We also establish an asymptotic relationship between the scaled version of offered waiting time and queue-length. As a consequence, we obtain the heavy traffic limit of the scaled queue-length. We introduce an infinite-horizon discounted cost functional whose running cost depends on the offered waiting time and server idle time processes. Under mild assumptions, we show that the expected value of this cost functional for the n-th system converges to that of the limiting diffusion process as n tends to infinity.     

Asymptotic Poisson Character of Extremes in Non-Stationary Gaussian Models

Let X be a non-stationary Gaussian process, asymptotically centered with constant variance. Let u be a positive real. Define R_u(t) as the number of upcrossings of level u by the process X on the interval (0, t]. Under some conditions we prove that the sequence of point processes (R_u)_u>0 converges weakly, after normalization, to a standard Poisson process as u tends to infinity. In consequence of this study we obtain the weak convergence of the normalized supremum to a Gumbel distribution.AMS 2000 Subject Classifications Primary—60G70, 60G15     

Heavy traffic analysis of controlled multiplexing systems

The paper develops the mathematics of the heavy traffic approach to the control and optimal control problem for multiplexing systems, where there are many mutually independent sources which feed into a single channel via a multiplexer (or of networks composed of such subsystems). Due to the widely varying bit rates over all sources, control over admission, bandwidth, etc., is needed to assure good performance. Optimal control and heavy traffic analysis has been shown to yield systems with greatly improved performance. Indeed, the heavy traffic approach covers many cases of great current interest, and provides a useful and practical approach to problems of analysis and control arising in modern high speed telecommunications. Past works on the heavy traffic approach to the multiplexing problem concentrated on the uncontrolled system or on the use of the heavy traffic limit control problem for applications, and did not provide details of the proofs. This is done in the current paper. The basic control problem for the physical system is hard, and the heavy traffic approach provides much simplification. Owing to the presence of the control, as well as to the fact that the cost function of main interest is “ergodic”, the problem cannot be fully treated with “classical” methods of heavy traffic analysis for queueing networks. A basic result is that the optimal average costs per unit time for the physical problem converge to the optimal cost per unit time for the limit stationary process as the number of sources and the time interval goes to infinity. This convergence is both in the mean and pathwise senses. Furthermore, a “nice” nearly optimal control for the limit system provides nearly optimal values for the physical system, under heavy traffic, in both a mean and pathwise sense. This revised version was published online in June 2006 with corrections to the Cover Date.     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

Asymptotic analysis of the loss probability in theGI/PH/1/K queue

We obtain an asymptotic behavior of the loss probability for theGI/PH/1/K queue asK tends to infinity when the traffic intensityρ is strictly less than one. It is shown that the loss probability tends to 0 at a geometric rate and that the decay rate is related to the matrix generating function describing the service completions during an interarrival time.     

An invariance principle for semimartingale reflecting Brownian motions in an orthant

Semimartingale reflecting Brownian motions in an orthant (SRBMs) are of interest in applied probability because of their role as heavy traffic approximations for open queueing networks. It is shown in this paper that a process which satisfies the definition of an SRBM, except that small random perturbations in the defining conditions are allowed, is close in distribution to an SRBM. This perturbation result is called an invariance principle by analogy with the invariance principle of Stroock and Varadhan for diffusions with boundary conditions. A crucial ingredient in the proof of this result is an oscillation inequality for solutions of a perturbed Skorokhod problem. In a subsequent paper, the invariance principle is used to give general conditions under which a heavy traffic limit theorem holds for open multiclass queueing networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the Behavior of Random Walk Around Heavy Points

Consider a symmetric aperiodic random walk in Z ^d , d≥3. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show that they converge to a deterministic limit as the number of steps tends to infinity.     

Robust and Accurate Inference via a Mixture of Gaussian and Student’s t Errors

A Gaussian measurement error assumption, that is, an assumption that the data are observed up to Gaussian noise, can bias any parameter estimation in the presence of outliers. A heavy tailed error assumption based on Student’s t distribution helps reduce the bias. However, it may be less efficient in estimating parameters if the heavy tailed assumption is uniformly applied to all of the data when most of them are normally observed. We propose a mixture error assumption that selectively converts Gaussian errors into Student’s t errors according to latent outlier indicators, leveraging the best of the Gaussian and Student’s t errors; a parameter estimation can be not only robust but also accurate. Using simulated hospital profiling data and astronomical time series of brightness data, we demonstrate the potential for the proposed mixture error assumption to estimate parameters accurately in the presence of outliers. Supplemental materials for this article are available online.