Queues as Harris recurrent Markov chains (Q1107225)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4064216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Queues as Harris recurrent Markov chains |
scientific article; zbMATH DE number 4064216 |
Statements
Queues as Harris recurrent Markov chains (English)
0 references
1988
0 references
We present a framework for representing a queue at arrival epochs as a Harris recurrent Markov chain (HRMC). The input to the queue is a marked point process governed by a HRMC and the queue dynamics are formulated by a general recursion. Such inputs include the cases of i.i.d., regenerative, Markov modulated, Markov renewal and the output from some queues as well. Since a HRMC is regenerative, the queue inherits the regenerative structure. As examples, we consider split \& match, tandem, G/G/c and more general skip forward networks. In the case of i.i.d. input, we show the existence of regeneration points for a Jackson type open network having general service and interarrival time distributions.
0 references
Harris recurrent Markov chain
0 references
marked point process
0 references
regenerative structure
0 references
0 references
0 references
0.7909831404685974
0 references
0.7849398255348206
0 references
0.77391117811203
0 references
0.7696642279624939
0 references
0.768574595451355
0 references
