Gordon and Newell Queueing Networks and Copulas
Yugoslav journal of operations research, Tome 19 (2009) no. 1, p. 101
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
Daniel Ciuiu. Gordon and Newell Queueing Networks and Copulas. Yugoslav journal of operations research, Tome 19 (2009) no. 1, p. 101 . http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a6/
@article{YJOR_2009_19_1_a6,
author = {Daniel Ciuiu},
title = {Gordon and {Newell} {Queueing} {Networks} and {Copulas}},
journal = {Yugoslav journal of operations research},
pages = {101 },
year = {2009},
volume = {19},
number = {1},
zbl = {1199.90002},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a6/}
}