Answers are grounded in this paper and cite their sources.
We provide the first perfect sampling algorithm for a generalized Jackson network of first-in, first-out queues under arbitrary topology and non-Markovian assumptions on the input of the network. We assume (in addition to stability) that the interarrival and service times of customers have a finite moment-generating function in a neighborhood of the origin, and the interarrival times have unbounded support.
No takes yet. Share an insight, caveat, or question.
Blanchet et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: