We conduct bottleneck analysis of a deterministic dynamic discrete-flow network. The analysis presupposes only the existence of long-run averages, and is based on a continuous fluid approximation to the network in terms of these averages. The results provide functional strong laws-of-large-numbers for stochastic Jackson queueing networks since they apply to their sample paths with probability one.
No takes yet. Share an insight, caveat, or question.
Chen et al. (1991) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: