Explicit formulas for E\(^{\theta}\)/G/1/N-type queueing systems (Q2722136)
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: Explicit formulas for E^/G/1/N-type queueing systems |
scientific article; zbMATH DE number 1617380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit formulas for E\(^{\theta}\)/G/1/N-type queueing systems |
scientific article; zbMATH DE number 1617380 |
Statements
11 July 2001
0 references
queueing system
0 references
limited queue
0 references
potential method
0 references
Explicit formulas for E\(^{\theta}\)/G/1/N-type queueing systems (English)
0 references
The author considers \(\text{E}^{\theta}/\)GI/1/N-type queueing systems with limited queue. For such systems the following characteristics are studied: queue length, busy period, waiting time, number of served claims, lost claims; residual queueing time, time to the lost of the first claim. Explicit formulae are derived for the mentioned characteristics. Also, for some of them, stationary characteristics are calculated. The investigation is based on the potential method proposed by \textit{V. S. Korolyuk} [``Limit problems for complicated Poisson processes'' (1975; Zbl 0329.60040)].
0 references
0.819238543510437
0 references
0.8066999912261963
0 references
0.800844132900238
0 references
0.7937601208686829
0 references
