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 li...
A new preprint "Functional central limit theorems for a large network in which customers join the sh...
AbstractWe consider a buffered queueing system that is fed by a Gaussian source and drained at a con...
This is a survey paper on fluid queues, with a strong emphasis on recent attempts to represent pheno...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus- tomer aba...
75 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.We also prove a functional cen...
The object of this research in the queueing theory is the Functional-Strong-Law-of-Large-Numbers (FS...
We introduce open stochastic fluid networks that can be regarded as continuous analogues or fluid li...
We study the heavy traffic regime of a discrete-time queue driven by correlated inputs, namely the M...
A superposition of a large number of infinite source Poisson inputs or that of a large number of ON-...
We introduce open stochastic fluid networks that can be regarded as continuous analogs or fluid limi...
In this paper we establish upper and lower bounds on the steady-state per-class workload distributio...
We identify conditions under which relatively large buffers will be required in broadband communicat...
textabstractConsider a fluid queue fed by $N$ on/off sources. It is assumed that the silence periods...
We consider a fluid model similar to that of Kella and Whitt [32], but with a buffer having finite c...
This book analyzes several types of queueing systems arising in network theory and communication the...
A new preprint "Functional central limit theorems for a large network in which customers join the sh...
AbstractWe consider a buffered queueing system that is fed by a Gaussian source and drained at a con...
This is a survey paper on fluid queues, with a strong emphasis on recent attempts to represent pheno...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus- tomer aba...
75 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.We also prove a functional cen...
The object of this research in the queueing theory is the Functional-Strong-Law-of-Large-Numbers (FS...
We introduce open stochastic fluid networks that can be regarded as continuous analogues or fluid li...
We study the heavy traffic regime of a discrete-time queue driven by correlated inputs, namely the M...
A superposition of a large number of infinite source Poisson inputs or that of a large number of ON-...
We introduce open stochastic fluid networks that can be regarded as continuous analogs or fluid limi...
In this paper we establish upper and lower bounds on the steady-state per-class workload distributio...
We identify conditions under which relatively large buffers will be required in broadband communicat...
textabstractConsider a fluid queue fed by $N$ on/off sources. It is assumed that the silence periods...
We consider a fluid model similar to that of Kella and Whitt [32], but with a buffer having finite c...
This book analyzes several types of queueing systems arising in network theory and communication the...
A new preprint "Functional central limit theorems for a large network in which customers join the sh...
AbstractWe consider a buffered queueing system that is fed by a Gaussian source and drained at a con...
This is a survey paper on fluid queues, with a strong emphasis on recent attempts to represent pheno...