Advances in modelling of complex systems : preface to the special issue
Erol Gelenbe (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Erol Gelenbe (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Pavel Bocharov, Ciro D'Apice, Evgeny Gavrilov, Alexandre Pechinkin (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: (0) an exponential node with servers, infinite buffer and FIFO discipline; (1) an infinite-server node; (2) a single-server node with infinite buffer and LIFO PR discipline; (3) a...
J. P. Keller (1978)
Publications du Département de mathématiques (Lyon)
Similarity:
Mirtchev, Seferin, Statev, Stanimir (2008)
Serdica Journal of Computing
Similarity:
This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005. This paper deals with a full accessibility loss system and a single server delay system with a Poisson arrival process and state dependent exponentially distributed service time. We use the generalized service flow with nonlinear state dependence mean service time. The idea is based on the analytical continuation of the Binomial distribution and the classic M/M/n/0 and M/M/1/k system....
Daduna, Hans (1991)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Joanna Domańska, Adam Domański, Dariusz Augustyn, Jerzy Klamka (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Bérczes, Tamás (2008)
Annales Mathematicae et Informaticae
Similarity:
K. L. Arya, E. Stachowski (1972)
Applicationes Mathematicae
Similarity:
Saulius Minkevičius (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The object of this research in the queueing theory is a theorem about the Strong-Law-of-Large-Numbers (SLLN) under the conditions of heavy traffic in a multiserver open queueing network. SLLN is known as a fluid limit or fluid approximation. In this work, we prove that the long-term average rate of growth of the queue length process of a multiserver open queueing network under heavy traffic strongly converges to a particular vector of rates. SLLN is proved for the values of an important...
Alfred Aanu Akinsete (2001)
Kragujevac Journal of Mathematics
Similarity:
J. R. Artalejo, A. Gómez-Corral (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Belarbi, Faiza, Bouchentouf, Amina Angelika (2010)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Le Gall, Pierre (1998)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
H. G. Perros (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: