Answers are grounded in this paper and cite their sources.
In this paper we have found an analytical formula for a copula that connects the numbers Ni of customers in the nodes of a Gordon and Newell queueing network. We have considered two cases: the first one is the case of the network with 2 nodes, and the second one is the case of the network with at least 3 nodes. The analytical formula for the second case has been found for the most general case (none of the constants from a list is equal to a given value), and the other particular cases have been obtained by limit.
No takes yet. Share an insight, caveat, or question.
Daniel Ciuiu (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: