Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions (Q5959268): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1013961710829 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1522431975 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:20, 30 July 2024
scientific article; zbMATH DE number 1723289
Language | Label | Description | Also known as |
---|---|---|---|
English | Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions |
scientific article; zbMATH DE number 1723289 |
Statements
Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions (English)
0 references
26 March 2002
0 references
A queueing system is considered where customers may be of \(P\) different classes and arrive according to a marked Markovian point process. The service time distributions depend on the class and the Markov state just before and just after arrival. An expression is derived for the generating function \(E[z_1^{X_1}\dots z_P^{X_P}]\) where \(X_k\) is the steady-state number of waiting customers of class \(k\); the formula is an integral involving the waiting time distributions \(w_1(dx), \dots,w_P(dx)\) of customers of different classes. Also, recursive formulas for determining the \(P(X_1=n_1, \dots,X_P =n_P)\) themselves are given.
0 references
marked Markovian point processes
0 references
generating function
0 references
waiting time distributions
0 references
recursive formulas
0 references