On network flow equations and splitting formulas for sojourn times in queueing networks.
Daduna, Hans (1991)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Displaying similar documents to “Blocked network of tandem queues with withdrawal”
On network flow equations and splitting formulas for sojourn times in queueing networks.
Product form solution for g-networks with dependent service
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...
On a network of M/M/n facilities with the intensity of new arrivals depending on the total number of waiting units
K. L. Arya, E. Stachowski (1972)
Applicationes Mathematicae
Similarity:
Dobrushin's approach to queueing network theory.
Karpelevich, F.I., Pechersky, E.A., Suhov, Yu.M. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
The Intermittent Server
J. P. Keller (1978)
Publications du Département de mathématiques (Lyon)
Similarity:
Performance analysis of multi-hop wireless packet networks.
Lim, J.-T., Meerkov, S.M. (1996)
Mathematical Problems in Engineering
Similarity:
A Packet Buffer Evaluation Method Exploiting Queueing Theory for Wireless Sensor Networks
Tie Qiu, Lin Feng, Feng Xia, Guowei Wu, Yu Zhou (2011)
Computer Science and Information Systems
Similarity:
QoS Testing In a Live Private IP MPLS Network with CoS Implemented
Živko Bojović, Emil Šećerov, Vlado Delić (2010)
Computer Science and Information Systems
Similarity:
A simulation of traffic equilibration multi-path routing in ad hoc networks.
Lieska, Kai, Jokela, Visa-Matti, Laitinen, Erkki (2004)
Lobachevskii Journal of Mathematics
Similarity:
Prognosis and optimization of homogeneous Markov message handling networks
Pavel Boček, Tomáš Feglar, Martin Janžura, Igor Vajda (2001)
Kybernetika
Similarity:
Message handling systems with finitely many servers are mathematically described as homogeneous Markov networks. For hierarchic networks is found a recursive algorithm evaluating after finitely many steps all steady state parameters. Applications to optimization of the system design and management are discussed, as well as a program product 5P (Program for Prognosis of Performance Parameters and Problems) based on the presented theoretical conclusions. The theoretic achievements as well...