Well-posedness of M/G/1 queueing model with single vacations. (Q1416313)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Well-posedness of M/G/1 queueing model with single vacations. |
scientific article; zbMATH DE number 2017126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Well-posedness of M/G/1 queueing model with single vacations. |
scientific article; zbMATH DE number 2017126 |
Statements
Well-posedness of M/G/1 queueing model with single vacations. (English)
0 references
14 December 2003
0 references
In M/G/1 queueing system with single vacations, the server takes exactly one vacation immediately after each busy period. If it finds no customers waiting upon returning from the vacation, it becomes idle until a customer arrives. When a customer arrives, it immediately starts to serve it. By using \(C_0\)-semigroup theory of linear operators, it is proved that the M/G/1 queueing model with single vacations has a unique nonnegative time-dependent solution which satisfies probability condition.
0 references
M/G/1 queueing model with single vacations
0 references
Dispersive operator
0 references
Conservative operator
0 references
\(C_0\)-semigroup
0 references
0 references
0 references
0 references
