Transient analysis of permanent customers in a single-server queue with mixed traffic (Q2709778)
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 1586975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Transient analysis of permanent customers in a single-server queue with mixed traffic |
scientific article; zbMATH DE number 1586975 |
Statements
17 February 2002
0 references
M/G/1 queue
0 references
cycle time
0 references
departure process
0 references
database striping
0 references
Transient analysis of permanent customers in a single-server queue with mixed traffic (English)
0 references
The paper discusses the \(M/G/1\) queue with \(M\) permanent customers in addition to the usual flow of standard customers. Each permanent customer remains in the system, re-joining the end of the queue on completion of service. Cycles are defined as the intervals between successive arrivals at the server of the same permanent customer; these divide naturally into alternating intervals in which ordinary and permanent customers are served. Laplace-Stieltjes transforms are calculated for (a) cycle lengths in the \(M/M/1\) case under various initial conditions, (b) successive departure times of permanent customers in the \(M/G/1\) case under general initial conditions. The probability distribution of the number of arrivals in the \(i\)th \(M/M/1\) cycle when \(M= 1\) is also given.
0 references
0.7955628037452698
0 references
0.7808634638786316
0 references
0.7805169224739075
0 references
0.7752554416656494
0 references
