Logo
Munich Personal RePEc Archive

Gordon and Newell queueing networks and copulas

Ciuiu, Daniel (2007): Gordon and Newell queueing networks and copulas. Published in: Yugoslav Journal of Operations Research , Vol. 19, No. 1 (July 2009): pp. 101-112.

[img]
Preview
PDF
MPRA_paper_15769.pdf

Download (323kB) | Preview

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.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.