scholarly journals On Truncation of the Matrix-Geometric Stationary Distributions

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 798 ◽  
Author(s):  
Naumov ◽  
Gaidamaka ◽  
Samouylov

In this paper, we study queueing systems with an infinite and finite number of waiting places that can be modeled by a Quasi-Birth-and-Death process. We derive the conditions under which the stationary distribution for a loss system is a truncation of the stationary distribution of the Quasi-Birth-and-Death process and obtain the stationary distributions of both processes. We apply the obtained results to the analysis of a semi-open network in which a customer from an external queue replaces a customer leaving the system at the node from which the latter departed.

1987 ◽  
Vol 24 (04) ◽  
pp. 965-977 ◽  
Author(s):  
Ilze Ziedins

We discuss the quasi-stationary distribution obtained when a simple birth and death process is conditioned on never exceeding K. An application of this model to one-dimensional circuit-switched communication networks is described, and some special cases examined.


1978 ◽  
Vol 10 (03) ◽  
pp. 570-586 ◽  
Author(s):  
James A. Cavender

Letqn(t) be the conditioned probability of finding a birth-and-death process in statenat timet,given that absorption into state 0 has not occurred by then. A family {q1(t),q2(t), · · ·} that is constant in time is a quasi-stationary distribution. If any exist, the quasi-stationary distributions comprise a one-parameter family related to quasi-stationary distributions of finite state-space approximations to the process.


1987 ◽  
Vol 24 (4) ◽  
pp. 965-977 ◽  
Author(s):  
Ilze Ziedins

We discuss the quasi-stationary distribution obtained when a simple birth and death process is conditioned on never exceeding K. An application of this model to one-dimensional circuit-switched communication networks is described, and some special cases examined.


1978 ◽  
Vol 10 (3) ◽  
pp. 570-586 ◽  
Author(s):  
James A. Cavender

Let qn(t) be the conditioned probability of finding a birth-and-death process in state n at time t, given that absorption into state 0 has not occurred by then. A family {q1(t), q2(t), · · ·} that is constant in time is a quasi-stationary distribution. If any exist, the quasi-stationary distributions comprise a one-parameter family related to quasi-stationary distributions of finite state-space approximations to the process.


2006 ◽  
Vol 2006 ◽  
pp. 1-15 ◽  
Author(s):  
Pauline Coolen-Schrijner ◽  
Erik A. van Doorn

The Karlin-McGregor representation for the transition probabilities of a birth-death process with an absorbing bottom state involves a sequence of orthogonal polynomials and the corresponding measure. This representation can be generalized to a setting in which a transition to the absorbing state (killing) is possible from any state rather than just one state. The purpose of this paper is to investigate to what extent properties of birth-death processes, in particular with regard to the existence of quasi-stationary distributions, remain valid in the generalized setting. It turns out that the elegant structure of the theory of quasi-stationarity for birth-death processes remains largely intact as long as killing is possible from only finitely many states. In particular, the existence of a quasi-stationary distribution is ensured in this case if absorption is certain and the state probabilities tend to zero exponentially fast.


1999 ◽  
Vol 36 (4) ◽  
pp. 1086-1100
Author(s):  
Carlos F. Borges ◽  
Craig S. Peters

We develop an algorithm for computing approximations to the stationary distribution of a discrete birth-and-death process, provided that the infinitesimal generator is a banded matrix. We begin by computing stationary distributions for processes whose infinitesimal generators are Hessenberg. Our derivation in this special case is different from the classical case but it leads to the same result. We then show how to extend these ideas to processes where the infinitesimal generator is banded (or half-banded) and to quasi-birth–death processes. Finally, we give an example of the application of this method to a nearly completely decomposable Markov chain to demonstrate the general applicability of the technique.


Sign in / Sign up

Export Citation Format

Share Document