Markovian queues with Poisson control
نویسندگان
چکیده
We investigate Markovian queues that are examined by a controller at random times determined Poisson process. Upon examination, the sets service speed to be equal minimum of current number customers in queue and certain maximum speed; this prevails until next examination time. study resulting two-dimensional Markov process length server speed, particular two regimes with time scale separation, specifically for infinitely frequent long times. In intermediate regime analysis proves extremely challenging. To gain further insight into model dynamics we then analyse variants which is just an observer does not change server.
منابع مشابه
Multiclass Markovian fluid queues
This paper considers a multiclass Markovian fluid queue with a buffer of infinite capacity. Input rates of fluid flows in respective classes and the drain rate from the buffer are modulated by a continuous-time Markov chain with finite states. We derive the joint Laplace-Stieltjes transform for the stationary buffer contents in respective classes, assuming the FIFO service discipline. Further w...
متن کاملAnalysis of Queues with Markovian Service Processes∗
Markovian service process (MSP) is a model similar to the Markovian arrival process (MAP), where arrivals are replaced with service completions. The MSP can represent various queueing models such as vacation models, N -policy models and exceptional service models. We analyze MAP/MSP/1 queues and obtain a new sort of matrix-type factorization of the vector generating function for the stationary ...
متن کاملMarkovian Queues with Correlated Arrival Processes
In an attempt to examine the effect of dependencies in the arrival process on the steady state queue length process in single server queueing models with exponential service time distribution, four different models for the arrival process, each with marginally distributed exponential interarrivals to the queueing system, are considered. Two of these models are based upon the upper and lower bou...
متن کاملMarkovian Retrial Queues with Two Way Communication
In this paper, we first consider single server retrial queues with two way communication. Ingoing calls arrive at the server according to a Poisson process. Service times of these calls follow an exponential distribution. If the server is idle, it starts making an outgoing call in an exponentially distributed time. The duration of outgoing calls follows another exponential distribution. An ingo...
متن کاملBounds For Markovian Queues With Possible Catastrophes
We consider a general Markovian queueing model with possible catastrophes and obtain new and sharp bounds on the rate of convergence. Some special classes of such models are studied in details, namely, (a) the queueing system with S servers, batch arrivals and possible catastrophes and (b) the queueing model with “attracted” customers and possible catastrophes. A numerical example illustrates t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 2023
ISSN: ['0019-3577', '1872-6100']
DOI: https://doi.org/10.1016/j.indag.2023.03.002