Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach (Q2731162)
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 1625618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach |
scientific article; zbMATH DE number 1625618 |
Statements
9 May 2002
0 references
M/M/\(c\) queue
0 references
busy period
0 references
number of customer
0 references
maximum entropy principle
0 references
Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach (English)
0 references
In the literature, there are two different types of busy period analysis: (i) Full busy period: a period commencing when an arriving customer finds \(c-1\) customers in the system and ending at the first departure epoch behind \(c-1\) customers. (ii) Partial busy period: a period commencing with the arrival of a customer who finds the system empty and ends at the first departure epoch in which the system becomes empty again. NEWLINENEWLINENEWLINEThe authors deal with the second kind of busy period of an \(\text{M/M}/c\) queue and with its algorithmic analysis giving the Laplace-Stieltjes transform of the busy period as a solution of a finite system of linear equations. The maximum entropy principle is done to analyze the influence of moments on the busy period distribution.
0 references
0.8743623495101929
0 references
0.8231949210166931
0 references
0.8152873516082764
0 references
0.7945238351821899
0 references
