Relating Time and Customer Averages for Queues Using ‘forward’ Coupling from the Past


We give a new method for simulating the time average steady-state distribution of a continuous-time queueing system, by extending a ‘read-once’ or ‘forward’ version of the coupling from the past (CFTP) algorithm developed for discrete-time Markov chains. We then use this to give a new proof of the ‘Poisson arrivals see time averages’ (PASTA) property, and a… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics