Munich Personal RePEc Archive
Login | Create Account

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 (2009): pp. 101-112.

Full text available as:

[img]PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
337Kb

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.

Item Type:MPRA Paper
Language:English
Keywords:Gordon and Newell queueing networks, copulas.
Subjects:C - Mathematical and Quantitative Methods > C6 - Mathematical Methods and Programming > C65 - Miscellaneous Mathematical Tools
C - Mathematical and Quantitative Methods > C5 - Econometric Modeling > C52 - Model Evaluation and Selection
C - Mathematical and Quantitative Methods > C4 - Econometric and Statistical Methods: Special Topics > C46 - Econometric and Statistical Methods: Specific Distributions
ID Code:15769
Deposited By:Dr. Daniel Ciuiu
Deposited On:10. Aug 2009 11:37
Last Modified:11. Aug 2009 07:41
References:

[1] Dall' Aglio, G., "Fréchet classes: the beginning", in: G., Dall' Aglio, S. Kotz, and G., Salinetti, (eds.), Advances in Probability Distributions with Given Marginals. Beyond the Copulas, Kluwer Academic Publishers, 1991, 1-12.

[2] Buzen, J., "Computational algorithms for closed queueing networks with exponential servers", Communications of the ACM, 16 (9) (1973) 527-531.

[3] Ciuiu, D., "Simulation experiments on the service systems using arrivals and services depending through copulas", The Annals of Bucharest University, 1 (2005) 17-30.

[4] Garzia, M., Garzia, R., Kiemele, M., and Lockhart C., Network Modeling, Simulation and Analysis, Marcel Decker, New York, Bassel, 1990.

[5] Gordon, W.J., and Newell, G.F., "Closed queueing systems with exponential servers", Operations Research, 15 (2) (1967) 254-265. D. Ciuiu / Gordon and Newell Queueing Networks and Copulas 112

[6] Iosifescu, M., Finite Markov Chains and Applications, Technical Editure, Bucharest/, Romanian, 1977.

[7] Kleinrock, L., Queueing Systems, John Wiley and Sons Inc., New York, Toronto, London, Sydney, 1975.

[8] Nelsen, R., "Copulas and association", in: G., Dall' Aglio, S., Kotz, and G., Salinetti, (eds.) Advances in Probability Distributions with Given Marginals. Beyond the Copulas, Kluwer Academic Publishers, 1991, 51-74.

[9] Schweizer, B., "Thirty years of copulas", in: Advances in Probability Distributions with Given Marginals. Beyond the Copulas, (eds.) G., Dall' Aglio, S., Kotz, and G., Salinetti, Kluwer Academic Publishers, 1991, 13-50.

[10] Sungur, E., and Tuncer, Y., "The use of copulas to generate new multivariate distributions. The frontiers of statistical computation, simulation & modeling", Proceedings of the ICOSCO-I Conference (The First International Conference on Statistical Computing, Çeşme, Izmir, Turkey), I (1987) 197-222.

[11] Văduva, I., Fast Algorithms for Computer Generation of Random Vectors used in Reliability and Applications, Preprint no. 1603, Jan. 1994, TH-Darmstadt.

[12] Văduva, I., "Simulation of some Multivariate Distributions", The Annals of the Bucharest University, 1 (2003) 127-140.

All papers reproduced by permission. Reproduction and distribution subject to the approval of the copyright owners.

Repository Staff Only: edit this item

LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.