Queueing systems with renovation (Q1379927)
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 1124523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Queueing systems with renovation |
scientific article; zbMATH DE number 1124523 |
Statements
Queueing systems with renovation (English)
0 references
1 October 1998
0 references
Summary: We study single channel queueing systems with renovation. Such models are often encountered in computer science applications. Explicit solutions are discussed for the queues with Poisson input flow and for queues with general input and exponential service times.
0 references
arrival flow
0 references
ergodicity conditions
0 references
queue length process
0 references
queueing system
0 references
renovation
0 references
semi-Markov process
0 references
stationary distribution
0 references
0.8088107705116272
0 references
0.8039939403533936
0 references
0.7998043894767761
0 references
0.7902286648750305
0 references
