Two-Time-Scale Markov Chains and Applications to Quasi-Birth-Death Queues
نویسندگان
چکیده
Aiming at reduction of complexity, this work is concerned with two-time-scale Markov chains and applications to quasi-birth-death queues. Asymptotic expansions of probability vectors are constructed and justified. Lumping all states of the Markov chain in each subspace into a single state, an aggregated process is shown to converge to a continuous-time Markov chain whose generator is an average with respect to the stationary measures. Then a suitably scaled sequence is shown to converge to a switching diffusion process. Extensions of the results are presented together with examples of quasi-birth-death queues.
منابع مشابه
Projection : An e cient solution algorithm for aclass of quasi - birth - death processes
Over the last two decades, considerable eeort has been put into the development of matrix geometric techniques 3] for the exact analysis of a general and frequently encountered class of queueing models that exhibit a regular structure. In these models, the embedded Markov chains are two-dimensional generalizations of elementary M/G/1 and G/M/1 queues 1]. The intersection of these two cases corr...
متن کاملExtended Abstract Submitted for Presentation at Pmccs-4 Projection: an Eecient Solution Algorithm for a Class of Quasi Birth-death Processes Background: Matrix Geometric Approach
Over the last two decades, considerable eeort has been put into the development of matrix geometric techniques 3] for the exact analysis of a general and frequently encountered class of queueing models that exhibit a regular structure. In these models, the embedded Markov chains are two-dimensional generalizations of elementary M/G/1 and G/M/1 queues 1]. The intersection of these two cases corr...
متن کاملQuasi-ergodic Nonstationary Queues
∗Department of Mathematics, Technion-Israel Institute of Technology ∗∗Vologda State Pedagogical University and Vologda Scientific Coordinate Centre of CEMI RAS, Vologda, Russia email: [email protected] Received October 14, 2002 Evaluation of the rate of convergence of stochastic models, as time t → ∞, has been a subject of investigation by generations of probabilists. During the last two de...
متن کاملQuasi-Stationary Distributions For A Class Of Discrete-Time Markov Chains
This paper is concerned with the circumstances under which a discrete-time absorbing Markov chain has a quasi-stationary distribution. We showed in a previous paper that a pure birth-death process with an absorbing bottom state has a quasi-stationary distribution – actually an infinite family of quasi-stationary distributions – if and only if absorption is certain and the chain is geometrically...
متن کاملQ-MAM: a tool for solving infinite queues using matrix-analytic methods
In this paper we propose a novel MATLAB tool, called Q-MAM, to compute queue length, waiting time and sojourn time distributions of various discrete and continuous time queuing systems with an underlying structured Markov chain/process. The underlying paradigms include M/G/1and GI/M/1-type, quasi-birth-death and non-skip-free Markov chains (implemented by the SMCSolver tool), as well as Markov ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal of Applied Mathematics
دوره 65 شماره
صفحات -
تاریخ انتشار 2004