Gordon and Newell queueing networks and copulas
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.
|Date of creation:||Dec 2007|
|Date of revision:||May 2009|
|Publication status:||Published in Yugoslav Journal of Operations Research 1.19(2009): pp. 101-112|
|Contact details of provider:|| Postal: |
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:15769. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht)
If references are entirely missing, you can add them using this form.