Analysis of an \(M\)/\(M\)/\(N\) queue with Bernoulli service schedule (Q840570)
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 5603387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of an \(M\)/\(M\)/\(N\) queue with Bernoulli service schedule |
scientific article; zbMATH DE number 5603387 |
Statements
Analysis of an \(M\)/\(M\)/\(N\) queue with Bernoulli service schedule (English)
0 references
13 September 2009
0 references
Summary: In this paper, a Markovian multiple server queue in which each server takes vacation according to Bernoulli scheduling service is studied. For this system, the stationary queue length distribution and several performance characteristics are obtained using the matrix geometric solution technique. The system busy period and waiting time distribution are discussed. The \(1\)-limited service and exhaustive service with multiple vacations are analysed as special cases. Extensive numerical illustrations are provided.
0 references
multiple server queues
0 references
Bernoulli vacation
0 references
matrix geometric
0 references
system size
0 references
busy period
0 references
mean waiting times
0 references
scheduling
0 references
stationary queue length distribution
0 references
0.857255220413208
0 references
0.8517879247665405
0 references
0.8472405076026917
0 references
0.8452624678611755
0 references
0.8442418575286865
0 references
