Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-04T18:47:25.943Z Has data issue: false hasContentIssue false

Stationary representation of queues. II

Published online by Cambridge University Press:  01 July 2016

Władysław Szczotka*
Affiliation:
Wrocław University
*
Postal address: Mathematical Institute, Wrocław University, pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland.

Abstract

The paper is a continuation of [7]. One of the main results is as follows: if the sequence (w, v, u) is asymptotically stationary in some sense then (l, w, v, u) is asymptotically stationary in the same sense. The other main result deals with an asymptotic behaviour of the vector of the queue size and the waiting time in the heavy-traffic situation. This result resembles a formula of the Little type.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Borovkov, A. A. (1972) Stochastic Processes in Queueing Theory (in Russian) Nauka, Moscow.Google Scholar
2. Breiman, L. (1968) Probability. Addision-Wesley, Reading, Mass.Google Scholar
3. Szczotka, W. (1973) M/G/1 queueing system with ‘fagging’ service channel. Zast. Mat. 13, 439463.Google Scholar
4. Szczotka, W. (1974) Immediate service in Benes-type G/G/1 queueing system. Zast. Mat. 14, 358363.Google Scholar
5. Szczotka, W. (1977) An invariance principle for queues in heavy traffic. Math. Operationsforsch. Statist., Ser. Optimization 8, 591631.CrossRefGoogle Scholar
6. Szczotka, W. (1986) Joint distribution of waiting time and queue size for single server queues, Dissertationes Math. 248.Google Scholar
7. Szczotka, W. (1986) Stationary representation of queues I. Adv. Appl. Prob. 18, 815848.CrossRefGoogle Scholar