\(\text{M/M}/m/\text{K}\) queue with nopassing and additional servers (Q2743863)
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: \(\text{M/M}/m/\text{K}\) queue with nopassing and additional servers |
scientific article; zbMATH DE number 1647623
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\text{M/M}/m/\text{K}\) queue with nopassing and additional servers |
scientific article; zbMATH DE number 1647623 |
Statements
17 September 2001
0 references
multiserver queue
0 references
Poisson input
0 references
nonpassing
0 references
finite buffer
0 references
dependence between queue-size and number of servers
0 references
\(\text{M/M}/m/\text{K}\) queue with nopassing and additional servers (English)
0 references
A multiserver queue with Poisson input exponential service times and finite buffer is considered, where customers leave the system in the same order in which they arrive. It may be treated as the presence of two types of customers having 1) zero service time and 2) exponential service time. Moreover, if the number of customers is greater than \(jN\) and less than \((j+1)N\), there will be \(j\) additional servers in the system (added to initial \(m\) ones), \(j+m\leq s\) for some \(s\). Steady-state distribution and expected waiting time are derived in an explicit form.
0 references