Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-13T06:53:46.591Z Has data issue: false hasContentIssue false
  • English
  • Français

Periodic queues in heavy traffic

Published online by Cambridge University Press:  01 July 2016

G. I. Falin
G. I. Falin*
Affiliation:
Moscow State University
*
∗Postal address: Department of Probability, Mechanics and Mathematics Faculty, Moscow State University, Moscow 119899, USSR.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

An analytic approach to the diffusion approximation in queueing due to Burman (1979) is applied to the M(t)/G/1/∞ queueing system with periodic Poisson arrivals. We show that under heavy traffic the virtual waiting time process can be approximated by a certain Wiener process with reflecting barrier at 0.

Keywords

POISSON ARRIVALSDIFFUSION APPROXIMATION
Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 21 , Issue 2 , June 1989 , pp. 485 - 487
Copyright
Copyright © Applied Probability Trust 1989 

References

[1] Burman, D. Y. (1979) An Analytic Approach to Diffusion Approximation in Queueing. , Department of Applied Mathematics, Courant Instutute of Mathematics, New York University.Google Scholar
[2] Ethier, S. and Kurtz, T. (1986) Markov Processes: Characterization and Convergence. Wiley, New York.CrossRefGoogle Scholar