Lattice path counting and \(M/M/c\) queueing systems (Q1892653)
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 765316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lattice path counting and \(M/M/c\) queueing systems |
scientific article; zbMATH DE number 765316 |
Statements
Lattice path counting and \(M/M/c\) queueing systems (English)
0 references
6 May 1996
0 references
The transient solution of \(M/M/c\) queue in a closed form is obtained for the probability of exactly \(i\) arrivals and \(j\) departures within a time interval of length \(t\). The method is based on the well-known combinatorial considerations: the authors count the paths from the origin to \((i,j)\) that have exactly \(r(d)\) \(x\)-steps whose depth from the line \(y = x\) is \(d = 0, \dots, c - 1\). Some numerical examples are considered.
0 references
transient solution
0 references
queue size
0 references
lattice path counting
0 references
depth of part
0 references
numerical examples
0 references
0.96907246
0 references
0.92715764
0 references
0.92406285
0 references
0.9068919
0 references
0.9039931
0 references
0.8977516
0 references
