Large Deviations Rate Function for Polling Systems

In this paper, we identify the local rate function governing the sample path large deviation principle for a rescaled process n−1Qnt, where Qt represents the joint number of clients at time t in a polling system with N nodes, one server and Markovian routing. By the way, the large deviation principle is proved and the rate function is shown to have the form conjectured by Dupuis and Ellis. We introduce a so called empirical generator consisting of Qt and of two empirical measures associated with St, the position of the server at time t. One of the main step is to derive large deviations bounds for a localized version of the empirical generator. The analysis relies on a suitable change of measure and on a representation of fluid limits for polling systems. Finally, the rate function is solution of a meaningful convex program. The method seems to have a wide range of application including the famous Jackson networks, as shown at the end of this study. An example illustrates how this technique can be used to estimate stationary probability decay rate.

[1]  R. Dobrushin,et al.  Large deviations for tandem queueing systems , 1994 .

[2]  Onno J. Boxma,et al.  Waiting Times in Polling Systems with Markovian Server Routing , 1989, MMB.

[3]  P. Dupuis,et al.  A VISCOSITY SOLUTION APPROACH TO THE ASYMPTOTIC ANALYSIS OF QUEUEING SYSTEMS , 1990 .

[4]  Michel Mandjes,et al.  Large Deviations for Performance Analysis: Queues, Communications, and Computing , Adam Shwartz and Alan Weiss (New York: Chapman and Hall, 1995). , 1996, Probability in the Engineering and Informational Sciences.

[5]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[6]  Hideaki Takagi,et al.  Queuing analysis of polling models , 1988, CSUR.

[7]  A. Ioffe,et al.  Theory of extremal problems , 1979 .

[8]  Arnaud de La Fortelle,et al.  Large Deviation Principle for Markov Chains in Continuous Time , 2001, Probl. Inf. Transm..

[9]  Arnaud de La Fortelle,et al.  Large Deviation Principle for Markov Chains in Discrete Time , 1999 .

[10]  A. D. L. Fortelle,et al.  Large deviations for polling systems , 2000 .

[11]  Arnaud de La Fortelle,et al.  Large deviations problems for star networks: The min policy , 2004, math/0406181.

[12]  Christine Fricker,et al.  Stability of Multi-server Polling Models , 1998 .

[13]  Paul Dupuis,et al.  Large deviations and queueing networks: Methods for rate function identification , 1998 .

[14]  P. Dupuis,et al.  Large deviations for Markov processes with discontinuous statistics, II: random walks , 1992 .

[15]  P. Dupuis,et al.  The large deviation principle for a general class of queueing systems. I , 1995 .

[16]  R. Schassberger,et al.  Ergodicity of a polling network , 1994 .

[17]  P. Dupuis,et al.  A time-reversed representation for the tail probabilities of stationary reflected Brownian motion , 2002 .

[18]  Douglas G. Down.  On the stability of polling models with multiple servers , 1996 .

[19]  P. Dupuis,et al.  Large deviations for Markov processes with discontinuous statistics , 1991 .

[20]  R. L. Dobrushin,et al.  LARGE DEVIATIONS FOR RANDOM PROCESSES WITH INDEPENDENT INCREMENTS ON INFINITE INTERVALS , 1998 .

[21]  Irina Ignatiouk-Robert,et al.  Large deviations of Jackson networks , 2000 .