3,135 research outputs found
Validity of heavy traffic steady-state approximations in generalized Jackson Networks
We consider a single class open queueing network, also known as a generalized
Jackson network (GJN). A classical result in heavy-traffic theory asserts that
the sequence of normalized queue length processes of the GJN converge weakly to
a reflected Brownian motion (RBM) in the orthant, as the traffic intensity
approaches unity. However, barring simple instances, it is still not known
whether the stationary distribution of RBM provides a valid approximation for
the steady-state of the original network. In this paper we resolve this open
problem by proving that the re-scaled stationary distribution of the GJN
converges to the stationary distribution of the RBM, thus validating a
so-called ``interchange-of-limits'' for this class of networks. Our method of
proof involves a combination of Lyapunov function techniques, strong
approximations and tail probability bounds that yield tightness of the sequence
of stationary distributions of the GJN.Comment: Published at http://dx.doi.org/10.1214/105051605000000638 in the
Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute
of Mathematical Statistics (http://www.imstat.org
A Maclaurin-series expansion approach to coupled queues with phase-type distributed service times
International audienc
On a generic class of two-node queueing systems
This paper analyzes a generic class of two-node queueing systems. A first queue is fed by an on–off Markov fluid source; the input of a second queue is a function of the state of the Markov fluid source as well, but now also of the first queue being empty or not. This model covers the classical two-node tandem queue and the two-class priority queue as special cases. Relying predominantly on probabilistic argumentation, the steady-state buffer content of both queues is determined (in terms of its Laplace transform). Interpreting the buffer content of the second queue in terms of busy periods of the first queue, the (exact) tail asymptotics of the distribution of the second queue are found. Two regimes can be distinguished: a first in which the state of the first queue (that is, being empty or not) hardly plays a role, and a second in which it explicitly does. This dichotomy can be understood by using large-deviations heuristics
Diffusion Models for Double-ended Queues with Renewal Arrival Processes
We study a double-ended queue where buyers and sellers arrive to conduct
trades. When there is a pair of buyer and seller in the system, they
immediately transact a trade and leave. Thus there cannot be non-zero number of
buyers and sellers simultaneously in the system. We assume that sellers and
buyers arrive at the system according to independent renewal processes, and
they would leave the system after independent exponential patience times. We
establish fluid and diffusion approximations for the queue length process under
a suitable asymptotic regime. The fluid limit is the solution of an ordinary
differential equation, and the diffusion limit is a time-inhomogeneous
asymmetric Ornstein-Uhlenbeck process (O-U process). A heavy traffic analysis
is also developed, and the diffusion limit in the stronger heavy traffic regime
is a time-homogeneous asymmetric O-U process. The limiting distributions of
both diffusion limits are obtained. We also show the interchange of the heavy
traffic and steady state limits
Stochastic modelling of energy harvesting for low power sensor nodes
Battery lifetime is a key impediment to long-lasting low power sensor nodes. Energy or power harvesting mitigates the ependency on battery power, by converting ambient energy into electrical energy. This energy can then be used by the device for data collection and transmission. This paper proposes and analyses a queueing model to assess performance of such an energy harvesting sensor node. Accounting for energy harvesting, data collection and data transmission opportunities, the sensor node is modelled as a paired queueing system. The system has two queues, one representing accumulated energy and the other being the data queue. By means of some numerical examples, we investigate the energy-information trade-off
- …