Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
Queueing networks with blocking
Queueing networks with blocking
Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
Performance Evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
Turning back time in Markovian process algebra
Theoretical Computer Science
Separable equilibrium state probabilities via time reversal in Markovian process algebra
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
G-networks with synchronised arrivals
Performance Evaluation
Multi-class network with phase type service time and group deletion signal
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Multiple class G-networks with restart
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
Exploiting product forms solution techniques in multiformalism modeling
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In queueing networks with blocking, stations wishing to transmit customers to a full queue are blocked and need to take alternative action on completing a service. In general, product-forms, i.e. separable solutions for such a network's equilibrium state probabilities, do not exist but some product-forms have been obtained over the years in special cases, using a variety of techniques. We show that the Reversed Compound Agent Theorem (RCAT) can obtain these diverse results in a uniform way by its direct application, so unifying product-forms in networks with and without blocking. New product-forms are also constructed for a type of blocking we call `skipping', where a blocked station sends its output-customers to the queue after the one causing the blocking in that customer's path. Finally, we investigate a novel congestion management scheme for networks of finite-capacity queues in which a station with a full queue transmits signals that delete customers from upstream queues in order to reduce incoming traffic.