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

Abstract

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 21 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.