Asymptotic stationarity of queues in series and the heavy traffic approximation (Q804097): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:06, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotic stationarity of queues in series and the heavy traffic approximation |
scientific article |
Statements
Asymptotic stationarity of queues in series and the heavy traffic approximation (English)
0 references
1990
0 references
For a sequence of single server queues with infinite waiting rooms under FCFS the joint departure processes, waiting time processes, and sojourn time processes are considered with respect to asymptotic behaviour in the sense of weak and strong convergence and convergence in variation of the random sequences, as well as that of Cesàro type limits. It is proved that if the input sequences (interarrival and service times) for the system are asymptotically stationary in one sense of the above definitions, then the process of the functionals mentioned above is asymptotically stationary in the same sense. Certain refinements of this are derived and heavy traffic results are obtained providing diffusion approximations.
0 references
tandem queues
0 references
heavy traffic limits
0 references
asymptotic stationarity
0 references
single server queues
0 references
weak and strong convergence
0 references
convergence in variation
0 references
Cesàro type limits
0 references
diffusion approximations
0 references