Hostname: page-component-6898cfcb55-zkb6p Total loading time: 0 Render date: 2026-11-11T10:20:05.691Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Correlation Structure of a Lévy-Driven Queue

Part of:Special processesStochastic processesOperations research and management science

Published online by Cambridge University Press:  14 July 2016

Abdelghafour Es-Saghouani and
Michel Mandjes
Abdelghafour Es-Saghouani*
Affiliation:
University of Amsterdam
Michel Mandjes*
Affiliation:
University of Amsterdam, CWI, and EURANDOM
*
∗ Postal address: Korteweg-de Vries Institute for Mathematics, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands. Email address: aessagho@science.uva.nl
∗∗ Postal address: CWI, PO Box 94079, 1090 GB Amsterdam, The Netherlands. Email address: mmandjes@science.uva.nl
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.

In this paper we consider a single-server queue with Lévy input and, in particular, its workload process (Q t )t≥0, with a focus on the correlation structure. With the correlation function defined as r(t) := cov(Q 0, Q t ) / var(Q 0) (assuming that the workload process is in stationarity at time 0), we first determine its transform ∫0 ∞ r(t)e-ϑt dt. This expression allows us to prove that r(·) is positive, decreasing, and convex, relying on the machinery of completely monotone functions. We also show that r(·) can be represented as the complementary distribution function of a specific random variable. These results are used to compute the asymptotics of r(t), for large t, for the cases of light-tailed and heavy-tailed Lévy inputs.

Keywords

Levy processreflectioncorrelationcomplete monotonicity

MSC classification

Secondary:60K25: Queueing theory60G51: Processes with independent increments; L'evy processes90B05: Inventory, storage, reservoirs

Information

Type
Research Article
Information
Journal of Applied Probability , Volume 45 , Issue 4 , December 2008, pp. 940 - 952
Copyright
Copyright © Applied Probability Trust 2008 

References

[1] Abate, J. and Whitt, W. (1988). The correlation functions of R{B}{M} and M/{M}/1. Stoch. Models 4, 315–359.CrossRefGoogle Scholar
[2] Abate, J. and Whitt, W. (1994). Transient behavior of the M/{G}/1 workload process. Operat. Res. 42, 750–764.Google Scholar
[3] Abate, J. and Whitt, W. (1997). Asymptotics for {M/G/1} low-priority waiting-time tail probabilities. Queueing Systems 25, 173–233.Google Scholar
[4] Asmussen, S. (2003). Applied Probability and Queues, 2nd edn. Springer, New York.Google Scholar
[5] Asmussen, S. and Glynn, P. (2007). Stochastic Simulation: Algorithms and Analysis (Stoch. Modelling Appl. Prob. 57). Springer, New York.Google Scholar
[6] Beneš, V. (1957). On queues with Poisson arrivals. Ann. Math. Statist. 28, 670–677.Google Scholar
[7] Bernstein, S. N. (1929). Sur les fonctions absolument monotones. Acta Math. 52, 1–66.Google Scholar
[8] Bertoin, J. (1996). Lévy Processes (Camb. Tracts Math. 121). Cambridge University Press.Google Scholar
[9] Bingham, N. H. (1975). Fluctuation theory in continuous time. Adv. Appl. Prob. 7, 705–766.Google Scholar
[10] Bingham, N. H. and Doney, R. A. (1974). Asymptotic properties of subcritical branching processes. I. The Galton–Watson process. Adv. Appl. Prob. 6, 711–731.Google Scholar
[11] Bingham, N. H. and Pitts, S. M. (1999). Non-parametric estimation for the M/{G}/∞ queue. Ann. Inst. Statist. Math. 51, 71–97.Google Scholar
[12] Bingham, N. H., Goldie, C. M. and Teugels, J. L. (1987). Regular Variation (Encyclopaedia Math. Appl. 27). Cambridge University Press.CrossRefGoogle Scholar
[13] Cox, D. R. and Smith, W. L. (1961). Queues. Methuen, London.Google Scholar
[14] Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Vol. 2, 2nd edn. John Wiley, New York.Google Scholar
[15] Hall, P. G. and Park, J. (2004). Nonparametric inference about service time distributions from indirect measurements. J. R. Statist. Soc. B 66, 861–875.Google Scholar
[16] Kella, O., Boxma, O. J. and Mandjes, M. (2006). A Lévy process reflected at a Poisson age process. J. Appl. Prob. 43, 221–230.Google Scholar
[17] Kyprianou, A. (2006). Introductory Lectures on Fluctuations of Lévy Processes with Applications. Springer, Berlin.Google Scholar
[18] Mandjes, M. (2007). Large Deviations for Gaussian Queues. John Wiley, Chichester.Google Scholar
[19] Mandjes, M. and van de Meent, R. (2008). Resource dimensioning through buffer sampling. To appear in IEEE/ACM Trans. Networking.Google Scholar
[20] Mandjes, M. and Zwart, B. (2006). Large deviations for sojourn times in processor sharing queues. Queueing Systems 52, 237–250.Google Scholar
[21] Morse, P. (1955). Stochastic properties of waiting lines. Operat. Res. 3, 255–261.Google Scholar
[22] Ott, T. (1977). The covariance function of the virtual waiting-time process in an M/{G}/1 queue. Adv. Appl. Prob. 9, 158–168.Google Scholar
[23] Reynolds, J. F. (1975). The covariance structure of queues and related processes—a survey of recent work. Adv. Appl. Prob. 7, 383–415.Google Scholar
[24] Sato, K. (1999). Lévy Processes and Infinitely Divisible Distributions (Camb. Studies Adv. Math. 68). Cambridge University Press.Google Scholar
[25] Zolotarev, V. (1964). The first passage time of a level and the behaviour at infinity for a class of processes with independent increments. Theory Prob. Appl. 9, 653–661.CrossRefGoogle Scholar