Gordon and Newell queueing networks and copulas

Daniel Ciuiu

MPRA Paper from University Library of Munich, Germany

Abstract: 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.

Keywords: Gordon and Newell queueing networks; copulas. (search for similar items in EconPapers)
JEL-codes: C46 C52 C65 (search for similar items in EconPapers)
Date: 2007-12, Revised 2009-05
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Published in Yugoslav Journal of Operations Research 1.19(2009): pp. 101-112

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/15769/1/MPRA_paper_15769.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:15769

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter (winter@lmu.de).