Results 201 to 210 of about 864 (228)

A Finite Buffer Fluid Queue Driven by a Markovian Queue

Queueing Systems, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Fluid approximations for a processor-sharing queue

Queueing Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong Chen 0012, Offer Kella, Gideon Weiss   +2 more
openaire   +2 more sources

V-uniform ergodicity for fluid queues

Applied Mathematics-A Journal of Chinese Universities, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Yuan-yuan, Li, Yang
openaire   +2 more sources

Fluid queue driven by aGI/GI/1 queue

Journal of Mathematical Sciences, 1998
The Laplace-Stieltjes transform of the stationary distribution of the buffer content in the case of M/GI/1 queue is the first phase. The author shows that this distribution depends on the form of the service-time distribution which entails that the change of GI/GI/1 by M/M/1 is not correct, in general.
openaire   +2 more sources

Fluid limits of queueing networks with batches

Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering, 2012
This paper presents an analytical model for the performance prediction of queueing networks with batch services and batch arrivals, related to the fluid limit of a suitable single-parameter sequence of continuous-time Markov chains and interpreted as the deterministic approximation of the average behaviour of the stochastic process.
Luca Bortolussi, Mirco Tribastone
openaire   +3 more sources

Approximate analysis of a network of fluid queues

ACM SIGMETRICS Performance Evaluation Review, 2007
Fluid models have for some time been used to approximate stochastic networks with discrete state. These range from traditional 'heavy traffic' approximations to the recent advances in bio-chemical system models. Here we use an approximate compositional method to analyse a simple feedforward network of fluid queues which comprises both probabilistic ...
Tony Field, Peter G. Harrison
openaire   +2 more sources

A TANDEM FLUID QUEUE WITH GRADUAL INPUT

Probability in the Engineering and Informational Sciences, 2002
For a two-node tandem fluid model with gradual input, we compute the joint steady-state buffer-content distribution. Our proof exploits martingale methods developed by Kella and Whitt. For the case of finite buffers, we use an insightful sample-path argument to extend an earlier proportionality result of Zwart to the network case.
Scheinhardt, Werner R.W., Zwart, Bert
openaire   +1 more source

ON THE COMPARISON OF QUEUEING SYSTEMS WITH THEIR FLUID LIMITS

Probability in the Engineering and Informational Sciences, 2001
A tandem of multiserver queues is compared with an associated fluid limit. It is shown that, for a certain class of cost functions, the expected cost incurred by the workload processes of the two models is lower for the fluid limit at all times. The analysis uses dynamic programming and phase-type distributions and extends to some other types of ...
Altman, Eitan, Jiménez, Tania, Koole, Ger   +2 more
openaire   +1 more source

Simple analysis of a fluid queue driven by an M/M/1 queue

Queueing Systems, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivo J. B. F. Adan, Jacques Resing
openaire   +1 more source

Sojourn Time Distribution in Fluid Queues

2019
We consider a fluid flow model with infinite buffer. We compute the Laplace-Stieltjes transform of the sojourn time proceeding in two steps. We first compute the stationary distribution of the buffer at arrival instants, using a change of clock. Secondly, we compute the transform of the time spent to empty the buffer. Numerical examples of sojourn time
Eleonora Deiana, Guy Latouche, Marie-Ange Remiche   +2 more
openaire   +3 more sources