Dynamics of Jackson networks: perturbation theory
classification
🧮 math.PR
keywords
formalismjacksonmethodnetworksbusy-busycomputecorrelationsdealing
read the original abstract
We introduce a new formalism for dealing with networks of queues. The formalism is based on the Doi-Peliti second quantization method for reaction diffusion systems. As a demonstration of the method's utility we compute perturbatively the different time busy-busy correlations between two servers in a Jackson network.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.