LIMITS FOR CUMULATIVE INPUT PROCESSES TO QUEUES

We establish functional central limit theorems (FCLTs) for a cumulative input process to a fluid queue from the superposition of independent on–off sources, where the on periods and off periods may have heavy-tailed probability distributions. Variants of these FCLTs hold for cumulative busy-time and idle-time processes associated with standard queueing models. The heavy-tailed on-period and off-period distributions can cause the limit process to have discontinuous sample paths (e.g., to be a non-Brownian stable process or more general Lévy process) even though the converging processes have continuous sample paths. Consequently, we exploit the Skorohod M1 topology on the function space D of right-continuous functions with left limits. The limits here combined with the previously established continuity of the reflection map in the M1 topology imply both heavy-traffic and non-heavy-traffic FCLTs for buffer-content processes in stochastic fluid networks.

[1]  T. Kurtz.  Limit theorems for workload input models , 2000 .

[2]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[3]  Martin I. Reiman,et al.  Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..

[4]  Takis Konstantopoulos,et al.  Macroscopic models for long-range dependent network traffic , 1998, Queueing Syst. Theory Appl..

[5]  J. W. Cohen,et al.  Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions , 1999, Queueing Syst. Theory Appl..

[6]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[7]  Ward Whitt,et al.  The Reflection Map with Discontinuities , 2001, Math. Oper. Res..

[8]  H. D. Miller.  Combinatorial methods in the theory of stochastic processes , 1968, Comput. J..

[9]  ERIC VAN DEN,et al.  WEAK CONVERGENCE OF HIGH-SPEED NETWORK TRAFFIC , 1999 .

[10]  Ward Whitt,et al.  The Brownian approximation for rate-control throttles and the G/G/1/C queue , 1992, Discret. Event Dyn. Syst..

[11]  Walter Willinger,et al.  On the Self-Similar Nature of Ethernet Traffic ( extended version ) , 1995 .

[12]  W. Whitt,et al.  Stability and structural properties of stochastic storage networks , 1996, Journal of Applied Probability.

[13]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[14]  Gennady Samorodnitsky,et al.  A heavy traffic limit theorem for workload processes with heavy tailed service requirements , 1998 .

[15]  Ward Whitt,et al.  Some Useful Functions for Functional Limit Theorems , 1980, Math. Oper. Res..

[16]  Sidney I. Resnick,et al.  Weak Convergence of high-speed network traffic models , 2000 .

[17]  A. Skorokhod.  Limit Theorems for Stochastic Processes , 1956 .

[18]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[19]  Murad S. Taqqu,et al.  On the Self-Similar Nature of Ethernet Traffic , 1993, SIGCOMM.

[20]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[21]  W. Whitt.  Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.

[22]  R. Dudley.  Distances of Probability Measures and Random Variables , 1968 .

[23]  Walter Willinger,et al.  Proof of a fundamental result in self-similar traffic modeling , 1997, CCRV.

[24]  Armand M. Makowski,et al.  Heavy traffic analysis for a multiplexer driven by M∨GI∨∞ input processes , 1997 .

[25]  O. Kella.  Parallel and Tandem Fluid Networks with Dependent Levy Inputs , 1993 .

[26]  Ward Whitt,et al.  Functional large deviation principles for first-passage-time processes , 1997 .

[27]  Sidney I. Resnick,et al.  Self-similar communication models and very heavy tails , 2000 .

[28]  Ward Whitt,et al.  An overview of Brownian and non-Brownian FCLTs for the single-server queue , 2000, Queueing Syst. Theory Appl..

[29]  V. Zolotarev.  One-dimensional stable distributions , 1986 .

[30]  Dianne P. O'Leary,et al.  What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses , 1995 .

[31]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[32]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[33]  J. Cohen.  A heavy-traffic theorem for the GI/G/1 queue with a Pareto-type service time distribution , 1997 .

[34]  Aleksander Weron,et al.  Stable Lévy motion approximation in collective risk theory , 1997 .

[35]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[36]  A. Shiryaev,et al.  Limit Theorems for Stochastic Processes , 1987 .

[37]  Armand M. Makowski,et al.  Heavy traffic limits associated with >M/G/∞ input processes , 2000, Queueing Syst. Theory Appl..

[38]  D. Applebaum.  Stable non-Gaussian random processes , 1995, The Mathematical Gazette.

[39]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .