Limit Behavior of Fluid Queues and Networks

A superposition of a large number of infinite source Poisson inputs or that of a large number of ON-OFF inputs with heavy tails can look like either a fractional Brownian motion or a stable Levy motion, depending on the magnification at which we are looking at the input process (Mikosch et al. 2002). In this paper, we investigate what happens to a queue driven by such inputs. Under such conditions, we study the output of a single fluid server and the behavior of a fluid queueing network. For the network we obtain random field limits describing the activity at different stations. In general, both kinds of stations arise in the same network: the stations of the first kind experience loads driven by a fractional Brownian motion, while the stations of the second kind experience loads driven by a stable Levy motion.

[1]  I. Kaj,et al.  Convergence of scaled renewal processes and a packet arrival model , 2003 .

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

[3]  J. Harrison.  The diffusion approximation for tandem queues in heavy traffic , 1978, Advances in Applied Probability.

[4]  S. Resnick,et al.  Is network traffic approximated by stable Levy motion or fractional Brownian motion , 2002 .

[5]  Takis Konstantopoulos,et al.  Fractional Brownian Approximations of Queueing Networks , 1996 .

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

[7]  Gennady Samorodnitsky.  Long Range Dependence, Heavy Tails and Rare Events , 2002 .

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

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

[10]  Allen B. Downey.  The structural cause of file size distributions , 2001, SIGMETRICS '01.

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

[12]  Ward Whitt,et al.  An Introduction to Stochastic-Process Limits and their Application to Queues , 2002 .

[13]  Gennady Samorodnitsky,et al.  Variable heavy tailed durations in Internet traffic. Part I. Understanding heavy tails , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[14]  Kevin Jeffay,et al.  What TCP/IP protocol headers can tell us about the web , 2001, SIGMETRICS '01.

[15]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[16]  Offer Kella.  Markov-modulated Feedforward Fluid Networks , 2001, Queueing Syst. Theory Appl..

[17]  M. Reiman.  Queueing networks in heavy traffic , 1977 .

[18]  P. Billingsley,et al.  Convergence of Probability Measures , 1970, The Mathematical Gazette.

[19]  M. Reiman.  The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks , 1982 .

[20]  Avishai Mandelbaum,et al.  Strong approximations for Markovian service networks , 1998, Queueing Syst. Theory Appl..

[21]  Gennady Samorodnitsky,et al.  Heavy Tails and Long Range Dependence in On/Off Processes and Associated Fluid Models , 1998, Math. Oper. Res..