A queueing system where customers require a random number of servers simultaneously (Q1068692)
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 3932754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A queueing system where customers require a random number of servers simultaneously |
scientific article; zbMATH DE number 3932754 |
Statements
A queueing system where customers require a random number of servers simultaneously (English)
0 references
1986
0 references
A closed single node queueing system with multiple classes is analyzed numerically. The node consists of M identical servers fed by a single queue. Each customer of class r, \(1\leq r\leq M\), acquires r servers simultaneously at the beginning of its service. All r servers are released at the same time upon completion of its service. The service time of a class r customer is exponentially distributed with a mean depending on r. This queueing model is analyzed with a view to obtaining performance measures such as throughput, distribution of busy servers, and queue-length distribution.
0 references
communications
0 references
closed single node queueing system
0 references
multiple classes
0 references
identical servers
0 references
single queue
0 references
performance measures
0 references
throughput
0 references
distribution of busy servers
0 references
queue-length distribution
0 references
0 references
0 references
0.8036737442016602
0 references
0.8009658455848694
0 references
0.7855203151702881
0 references
0.7851147651672363
0 references
