z-logo
open-access-imgOpen Access
Limit Behavior of Fluid Queues and Networks
Author(s) -
Bernardo D’Auria,
Gennady Samorodnitsky
Publication year - 2005
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.1050.0215
Subject(s) - queue , limit (mathematics) , brownian motion , superposition principle , reflected brownian motion , queueing theory , fractional brownian motion , computer science , heavy traffic approximation , fluid queue , statistical physics , mathematics , mathematical optimization , mathematical analysis , physics , diffusion process , geometric brownian motion , statistics , computer network , knowledge management , innovation diffusion
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 Lévy 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 Lévy motion.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom