اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDoubling Algorithms for Stationary Distributions of Fluid Queues: A Probabilistic Interpretation
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Fluid queues are mathematical models frequently used in stochastic modelling. Their stationary distributions involve a key matrix recording the conditional probabilities of returning to an initial level from above, often known in the literature as the matrix $Psi$. Here, we present a probabilistic interpretation of the family of algorithms known as emph{doubling}, which are currently the most effective algorithms for computing the return probability matrix $Psi$. To this end, we first revisit the links described in cite{ram99, soares02} between fluid queues and Quasi-Birth-Death processes; in particular, we give new probabilistic interpretations for these connections. We generalize this framework to give a probabilistic meaning for the initial step of doubling algorithms, and include also an interpretation for the iterative step of these algorithms. Our work is the first probabilistic interpretation available for doubling algorithms.
قيم البحث
اقرأ أيضاً
A Markovian single-server queue is studied in an interactive random environment. The arrival and service rates of the queue depend on the environment, while the transition dynamics of the random environment depends on the queue length. We consider in
detail two types of Markov random environments: a pure jump process and a reflected jump-diffusion. In both cases, the joint dynamics is constructed so that the stationary distribution can be explicitly found in a simple form (weighted geometric). We also derive an explicit estimate for exponential rate of convergence to the stationary distribution via coupling.
We consider the so-called GI/GI/N queue, in which a stream of jobs with independent and identically distributed service times arrive as a renewal process to a common queue that is served by $N$ identical parallel servers in a first-come-first-serve m
anner. We introduce a new representation for the state of the system and, under suitable conditions on the service and interarrival distributions, establish convergence of the corresponding sequence of centered and scaled stationary distributions in the so-called Halfin-Whitt asymptotic regime. In particular, this resolves an open question posed by Halfin and Whitt in 1981. We also characterize the limit as the stationary distribution of an infinite-dimensional two-component Markov process that is the unique solution to a certain stochastic partial differential equation. Previous results were essentially restricted to exponential service distributions or service distributions with finite support, for which the corresponding limit process admits a reduced finite-dimensional Markovian representation. We develop a different approach to deal with the general case when the Markovian representation of the limit is truly infinite-dimensional. This approach is more broadly applicable to a larger class of networks.
We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience times of
each customer. Deterministic fluid models are established to provide first-order approximation for this model. The fluid model solution, which is proved to uniquely exists, serves as the fluid limit of the many-server queue, as the number of servers becomes large. Based on the fluid model solution, first-order approximations for various performance quantities are proposed.
Suppose that $X$ is a subcritical superprocess. Under some asymptotic conditions on the mean semigroup of $X$, we prove the Yaglom limit of $X$ exists and identify all quasi-stationary distributions of $X$.
We consider a stochastic fluid queue served by a constant rate server and driven by a process which is the local time of a certain Markov process. Such a stochastic system can be used as a model in a priority service system, especially when the time
scales involved are fast. The input (local time) in our model is always singular with respect to the Lebesgue measure which in many applications is ``close to reality. We first discuss how to rigorously construct the (necessarily) unique stationary version of the system under some natural stability conditions. We then consider the distribution of performance steady-state characteristics, namely, the buffer content, the idle period and the busy period. These derivations are much based on the fact that the inverse of the local time of a Markov process is a Levy process (a subordinator) hence making the theory of Levy processes applicable. Another important ingredient in our approach is the Palm calculus coming from the point process point of view.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
