Results 181 to 190 of about 1,352 (222)
Some of the next articles are maybe not open access.
Performance of multiclass Markovian queueing networks
Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187), 2002We study the distribution of steady-state queue lengths in multiclass queueing networks under a stable policy. We propose a general methodology based on Lyapunov functions, for the performance analysis of infinite state Markov chains and apply it specifically to Markovian multiclass queueing networks.
Dimitris Bertsimas +2 more
openaire +1 more source
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
Parallel simulation of Markovian queueing networks
Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2002Consider simulating a large queueing network, i.e., one with many queues and jobs, on a parallel computer. Suppose the network is partitioned so that each processor is assigned a set of queues to simulate. The basic difficulty in parallel simulation is synchronizing the simulation clocks on each of the processors so that events appear to get executed ...
Philip Heidelberger, David M. Nicol
openaire +1 more source
MQNA - Markovian queueing networks analyser
11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003., 2004This paper describes the MQNA - Markovian queueing networks analyser, a software tool to model and obtain the stationary solution of a large class of queueing networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms.
Leonardo Brenner +2 more
openaire +1 more source
Prediction in Markovian bulk arrival queues
Queueing Systems, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carmen Armero, David V. Conesa
openaire +2 more sources
The Markovian Queue with Bounded Waiting time
Management Science, 1977The single-server queueing system is studied where arrivals are rejected if their waiting plus service times would exceed a fixed amount K. Applications of this model include equipment repair facilities and buffered communication devices with constant discharge rate receiving messages from a high-speed data channel.
Bezalel Gavish, Paul J. Schweitzer
openaire +2 more sources
A heuristic for the transient expected queue length of Markovian queueing systems
Operations Research Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I-Jen Lee, Emily Roth
openaire +1 more source
2012
Queueing systems whose underlying stochastic process is a continuous-time Markov chain (CTMCs) are the simplest and most often used class of queueing systems. The analysis of these systems is based on the essential results available for the analysis of CTMCs. As a consequence, several interesting properties of these queueing systems can be described by
László Lakatos +2 more
openaire +1 more source
Queueing systems whose underlying stochastic process is a continuous-time Markov chain (CTMCs) are the simplest and most often used class of queueing systems. The analysis of these systems is based on the essential results available for the analysis of CTMCs. As a consequence, several interesting properties of these queueing systems can be described by
László Lakatos +2 more
openaire +1 more source
2020
Most continuous-time Markov chains arising in operations research receive a natural description in terms of a mapping transforming an input into an output called the state process.
openaire +1 more source
Most continuous-time Markov chains arising in operations research receive a natural description in terms of a mapping transforming an input into an output called the state process.
openaire +1 more source
Optimal assignments in a markovian queueing system
Computers & Operations Research, 1981Abstract A generalization of the Hypercube queueing model for exponential queueing systems is presented which allows for distinguishable servers and multiple types of customers. Given costs associated with each server-customer pair, the determination of the assignment policy which minimizes time-averaged costs is formulated as a Markov decision ...
openaire +1 more source