Approximate Analysis of Blocking Queueing Networks with Temporal Dependence

Provided by: Imperial College London
Topic: Big Data
Format: WORD
In this paper, the authors extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited concurrency level. They consider two different blocking mechanisms: Repetitive Service-Random Destination (RS-RD) and Blocking After Service (BAS). They propose a methodology to evaluate MAP queueing networks with blocking based on the recently proposed Quadratic Reduction (QR), a state space transformation that decreases the number of states in the Markov chain underlying the queueing network model. From this reduced state space, they obtain boundable approximations on average performance indexes such as throughput, response time, utilizations.

Find By Topic