Modeling a class of flexible manufacturing systems with reversible routing
Operations Research
Markovian network processes: congestion-dependent routing and processing
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
The Erlang model with non-poisson call arrivals
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
International Journal of Applied Mathematics and Computer Science
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
In this paper we study Markovian queueing networks in which the service and the routing characteristics have a particular form which leads to a product form stationary distribution for the number of customers in the various queues of the network. We show that if certain transitions are prohibited due to blocking conditions, then the form of the stationary distribution is preserved under a certain rerouting protocol. Several examples are presented which illustrate the wide applicability of the model.