Results 191 to 200 of about 864 (228)
Some of the next articles are maybe not open access.
Fluid Models for Multiserver Queues with Abandonments
Operations Research, 2006Deterministic fluid models are developed to provide simple first-order performance descriptions for multiserver queues with abandonment under heavy loads. Motivated by telephone call centers, the focus is on multiserver queues with a large number of servers and nonexponential service-time and time-to-abandon distributions. The first fluid model serves
Ward Whitt
exaly +3 more sources
Level-Phase Independence for Fluid Queues
Stochastic Models, 2005ABSTRACT A Markov-modulated fluid queue is a two-dimensional Markov process; the first dimension is continuous and is usually called the level, and the second is the state of a Markov process that determines the evolution of the level, it is usually called the phase.
Guy Latouche
exaly +3 more sources
Risk processes analyzed as fluid queues
Scandinavian Actuarial Journal, 2005This paper presents the Laplace transform of the time until ruin for a fairly general risk model. The model includes both the classical and most Sparre-Andersen risk models with phase-distributed claim amounts as special cases. It also allows for correlated arrival processes, and claim sizes that depend upon environmental factors such as periods of ...
David Stanford +2 more
exaly +4 more sources
A fluid queue driven by a Markovian queue
Queueing Systems, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruno Sericola, Bruno Tuffin
openaire +2 more sources
Approximating the heterogeneous fluid queue with a birth-death fluid queue
IEEE Transactions on Communications, 1995Recent research has shown that fluid-flow queueing models accurately determine the burst level component of the ATM multiplexer process, and fluid models therefore constitute an efficient tool for the investigation of admission control in ATM networks.
Soren Blaabjerg +2 more
openaire +2 more sources
Fluid queue driven by anM/M/1 queue
Queueing Systems, 1994A fluid queue receiving its input from the output of a preceding M/M/1 queue is considered. The input can be characterized as a Markov modulated rate process and the well known spectral decomposition technique can be applied. The novel features in this system relate to the nature of the spectrum, which is shown to be composed of a continuous part and ...
Virtamo, Jorma, Norros, Ilkka
openaire +5 more sources
Multiclass Markovian fluid queues
Queueing Systems, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hiroyuki Masuyama, Tetsuya Takine
openaire +3 more sources
Journal of Applied Probability, 2004
We consider a fluid queue controlled by a semi-Markov process and we apply the Markov-renewal approach developed earlier in the context of quasi-birth-and-death processes and of Markovian fluid queues. We analyze two subfamilies of semi-Markov processes.
Latouche, Guy, Takine, Tetsuya
openaire +3 more sources
We consider a fluid queue controlled by a semi-Markov process and we apply the Markov-renewal approach developed earlier in the context of quasi-birth-and-death processes and of Markovian fluid queues. We analyze two subfamilies of semi-Markov processes.
Latouche, Guy, Takine, Tetsuya
openaire +3 more sources
CLOUD STORAGE FACILITY AS A FLUID QUEUE CONTROLLED BY MARKOVIAN QUEUE
Probability in the Engineering and Informational Sciences, 2020Cloud storage faces many problems in the storage process which badly affect the system's efficiency. One of the most problems is insufficient buffer space in cloud storage. This means that the packets of data wait to have storage service which may lead to weakness in performance evaluation of the system.
A. H. El-Baz +2 more
openaire +2 more sources
On fluid queueing system with strict priority
Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), 2002In telecommunication systems, different applications have different quality of service requirements. We consider a fluid queueing system with two priority classes. High priority traffic has strict priority access to service to meet its stringent quality of service requirements. We analyze steady state queueing behavior of the system. Analytical results
Yong Liu 0013, Weibo Gong
openaire +2 more sources