The heavy traffic limit of a class of Markovian queueing models (Q1095501): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(87)90048-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2132862313 / rank | |||
Normal rank | |||
Revision as of 19:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The heavy traffic limit of a class of Markovian queueing models |
scientific article |
Statements
The heavy traffic limit of a class of Markovian queueing models (English)
0 references
1987
0 references
Consider a Markov chain on an infinite bivariate state space with transition matrix of the form \[ \left[\begin{matrix} K(0)& H(1)& H(2)& H(3)& ... \\ K(1)& G(0)& G(1)& G(2)& ... \\ K(2)& G(-1)& G(0)& G(1)& ... \\ K(3)& G(-2)& G(-1)& G(0)& ... \\ \vdots& & &\vdots &\ddots \end{matrix}\right] \] where the G(i) are \(m\times m\) matrices. (Special cases are transition matrices of G/M/1- and M/G/1-type.) The variable i of K(i) denotes the ``level'' of the associated subset of the state space. The paper presents a ``heavy traffic'' approximation of the level process by reflected Brownian motion. From this, approximations of transient and ergodic behaviour are obtained.
0 references
heavy traffic approximation
0 references
heavy traffic limit theorem
0 references
matrix- geometric stationary distribution
0 references
transition matrix
0 references
reflected Brownian motion
0 references
transient and ergodic behaviour
0 references
