Results 171 to 180 of about 1,352 (222)

Cooperation in Markovian queueing models

European Journal of Operational Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
María Dolores García-Sanz, Francisco R. Fernández, M. Gloria Fiestras-Janeiro, Ignacio García-Jurado, Justo Puerto   +4 more
openaire   +2 more sources

Multiclass Markovian fluid queues

Queueing Systems, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hiroyuki Masuyama, Tetsuya Takine
openaire   +2 more sources

A Diffusion Approximation for a Markovian Queue with Reneging

Queueing Systems, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amy R. Ward, Peter W. Glynn
openaire   +1 more source

Bayesian inference in Markovian queues

Queueing Systems, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Nonstationary Markovian queues

Journal of Mathematical Sciences, 2000
The authors consider a class of nonhomogeneous birth-death processes on the nonnegative integers with birth and death rates of the form \(\lambda_n(t)= \lambda_n a(t)\) and \(\mu_n(t)= \mu_nb(t)\). Their main objective is to study the speed of convergence of such processes when convergence occurs in some sense.
Granovsky, B. L., Zeifman, A. I.
openaire   +2 more sources

A matrix geometric representation for the queue length distribution of multitype semi-Markovian queues

Performance Evaluation, 2012
: In this paper we study a broad class of semi-Markovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue and others, as well as queues with correlated inter-arrival and service times ...
Benny Van Houdt
exaly   +1 more source

Markovian Queue with Garbage Collection

2017
Garbage collection is a fundamental component of memory management in several software frameworks. We present a general two-dimensional Markovian model of a queue with garbage collection where the input process is Markov-modulated and the memory consumption can be modeled with discretisation.
Illés Horváth, István Finta, Ferenc Kovács, András Mészáros, Roland Molontay, Krisztián Varga   +5 more
openaire   +1 more source

Transient solutions in Markovian Queueing Systems

Computers & Operations Research, 1977
Abstract This paper discusses the methods available to find transient solutions for huge, but sparse Markov processes, as they arise in connection with queueing systems. The methods discussed include Runge-Kutta, Liou's method and randomization. It is shown that all these methods are closely related, but that the method of randomization is superior ...
openaire   +1 more source

A Finite Buffer Fluid Queue Driven by a Markovian Queue

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

Diffusion Approximations for Queues with Markovian Bases

Annals of Operations Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source