University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Simulation-based computation of the workload correlation function in a Levy-driven queue

Simulation-based computation of the workload correlation function in a Levy-driven queue

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sarah Lilienthal.

Joint with Newton Institue, Stochastic Processes in Communication Sciences Program.

We consider a single-server queue with Levy input, and in particular its workload process Q(t), focusing on its correlation structure. With the correlation function defined as r(t) := Cov(Q(0), Q(t))/Var Q(0) (assuming the workload process is in stationarity at time 0), we first study its transform int_0\infty r(t)e{-theta t} dt, both for the case that the Levy process has positive jumps, and that it has negative jumps. These expressions allow us to prove that r(t) is positive, decreasing, and convex, relying on the machinery of completely monotone functions. For the light-tailed case, we estimate the behavior of r(t) for t large. We then focus on techniques to estimate r(t) by simulation. Naive simulation techniques require roughly 1/r(t)^2 runs to obtain an estimate of a given precision, but we develop a coupling technique that leads to substantial variance reduction (required number of runs being roughly 1/r(t)). If this is augmented with importance sampling, it even leads to a logarithmically efficient algorithm.

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity