Matrix product form solution for closed synchronized queuing networks
Authors:
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 29-37
Abstract
A new solution is presented for the steady-state probability computing of closed synchronized queuing networks. A closed synchronized queuing network is a particular Markov stochastic Petri net (bounded and monovaluated Petri net with a strongly connected reachability graph and constant firing rates independent of markings). The authors show that the steady-state probability distribution can be expressed using matrix products. The results generalize the Gordon-Newell theorem. The solution is similar to the Gordon-Newell product form solution using a matrix and vectors instead of scalars. A prototype solver developed from the preceding result is presented.Keywords
This publication has 8 references indexed in Scilit:
- Markovian Petri Net protocols with product form solutionPerformance Evaluation, 1991
- One-place unbounded stochastic petri nets: Ergodic criteria and steady-state solutionsJournal of Systems and Software, 1986
- Computer Performance Evaluation MethodologyIEEE Transactions on Computers, 1984
- Two Parallel Queues Created by Arrivals with Two Demands ISIAM Journal on Applied Mathematics, 1984
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Closed Queuing Systems with Exponential ServersOperations Research, 1967
- Jobshop-Like Queueing SystemsManagement Science, 1963