On stationary queue length distributions for G/M/s/r queues (Q1120916): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3333844 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3685806 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4733214 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4100724 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4742086 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3678435 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method for solving a class of recursive stochastic equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5602045 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The intensity conservation law for queues with randomly changed service rate / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The substability and ergodicity of complicated queueing systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Combinatorial Method in the Theory of Queues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4748956 / rank | |||
Normal rank |
Latest revision as of 15:28, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On stationary queue length distributions for G/M/s/r queues |
scientific article |
Statements
On stationary queue length distributions for G/M/s/r queues (English)
0 references
1988
0 references
Consider a G/M/s/r queue, where the sequence \(\{A_ n\}^{\infty}_{n=-\infty}\) of nonnegative interarrival times is stationary and ergodic, and the service times \(S_ n\) are i.i.d. exponentially distributed. (Since \(A_ n=0\) is possible for some n, batch arrivals are included.) In case \(r<\infty\), a uniquely determined stationary process of the number of customers in the system is constructed. Furthermore, we give a proof of the relation \(\min (i,s)\bar p(i)=\rho p(i-1),\quad 1\leq i\leq r+s,\) between the time- and arrival- stationary probabilities \(\bar p(i)\) and p(i), respectively.
0 references
batch arrivals
0 references
relations between arrival- and time-stationary
0 references
probabilities
0 references
stationary point process
0 references