Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-10T21:21:05.353Z Has data issue: false hasContentIssue false
  • English
  • Français

Heavy traffic results for single-server queues with dependent (EARMA) service and interarrival times

Published online by Cambridge University Press:  01 July 2016

Patricia A. Jacobs
Patricia A. Jacobs*
Affiliation:
Naval Postgraduate School, Monterey, California
*
∗Postal address: Department of Operations Research, Naval Postgraduate School, Monterey, CA 93940, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

Models are given for sequences of correlated exponential interarrival and service times for a single-server queue. These multivariate exponential models are formed as probabilistic linear combinations of sequences of independent exponential random variables and are easy to generate on a computer. Limiting results for customer waiting time under heavy traffic conditions are obtained for these queues. Heavy traffic results are useful for analyzing the effect of correlated interarrival and service times in queues on such quantities as queue length and customer waiting time. They can also be used to check simulation results.

Keywords

HEAVY TRAFFIC RESULTSCORRELATED INTERARRIVAL AND SERVICE TIMESMULTIVARIATE EXPONENTIAL RANDOM VARIABLESWEAK CONVERGENCEARMA CORRELATED EXPONENTIAL SEQUENCES
Type
Research Article
Information
Advances in Applied Probability , Volume 12 , Issue 2 , June 1980 , pp. 517 - 529
Copyright
Copyright © Applied Probability Trust 1980 

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.)

Footnotes

Support from NSF grants ENG-77-09020 and ENG-79-01438 and ONR contract NR-42-284 is gratefully acknowledged.

References

1. Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
2. Boonsong, P. (1978) A Simulation Study of a Class of First-Come First-Served Queues with earma Correlation Structure. , Naval Postgraduate School, Monterey, California.Google Scholar
3. Jacobs, P. A. and Lewis, P. A. W. (1977) A mixed autoregressive-moving average exponential sequence and point process (earma 1, 1). Adv. Appl. Prob. 9, 87–104.CrossRefGoogle Scholar
4. Jacobs, P. A. (1978) A cyclic queueing network with dependent exponential service times. J. Appl. Prob. 15, 573–589.CrossRefGoogle Scholar
5. Kingman, J. F. C. (1962) On queues in heavy traffic. J. Roy. Statist. Soc. B 24, 383–392.Google Scholar
6. Lewis, P. A. W. and Shedler, G. S. (1977) Analysis and modelling of point processes in computer systems. Bull. Int. Statist. Inst. 47, 193–210.Google Scholar
7. Lewis, P. A. W. and Shedler, G. S. (1977) Analysis and modelling of point processes in computer systems. Naval Postgraduate School Technical Report NPS55-77-38.Google Scholar
8. Lindvall, T. (1973) Weak convergence of probability measures and random functions in the function space D[0, ∞). J. Appl. Prob. 10, 109–121.CrossRefGoogle Scholar
9. Loynes, R. M. (1962) The stability of a queue with non-independent interarrival and services. Proc. Camb. Phil. Soc. 58, 497–520.CrossRefGoogle Scholar
10. Rosenblatt, M. (1971) Markov Processes. Structure and Asymptotic Behavior. Springer-Verlag, Berlin.CrossRefGoogle Scholar