On a numerical method for calculating state probabilities for queueing systems with more than one waiting line (Q1094319): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-0427(87)90129-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064281565 / rank | |||
Normal rank | |||
Revision as of 01:25, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a numerical method for calculating state probabilities for queueing systems with more than one waiting line |
scientific article |
Statements
On a numerical method for calculating state probabilities for queueing systems with more than one waiting line (English)
0 references
1987
0 references
A numerical method for calculating state probabilities of queueing systems with more than one waiting line in parallel is based on power series expansions of state probabilities as functions of the traffic intensity of the system. Coefficients of these power series are calculated recursively, and coefficients of power series expansions of moments of queue length distributions are derived from them. Their extrapolations at the origin are obtained using the asymptotic behaviour of moments in heavy traffic. Two examples of exponential queueing systems are used to illustrate and discuss the method.
0 references
queues in parallel
0 references
traffic intensity
0 references
state probabilities of queueing systems
0 references
power series expansions
0 references
moments of queue length distributions
0 references
exponential queueing systems
0 references
