Algorithmic product-form approximations of interacting stochastic models

Authors:
Andrea Marin;Maria Grazia Vigliotti
Affiliations:
Universití Ca' Foscari Venezia, DAIS, via Torino 155, Venezia, Italy;Department of Computing, Imperial College London, South Kensington Campus, SW7 2BZ, UK
Venue:
Computers & Mathematics with Applications
Year:
2012

Citing 8
Cited 0

Product Form Approximations for Queueing Networks with Multiple Servers and Blocking

IEEE Transactions on Computers
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
A Characterization of Product-Form Queuing Networks

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
Adaptive decomposition and approximation for the analysis of stochastic petri nets

Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
A general result for deriving product-form solutions in markovian models

Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
Product form approximations for communicating Markov processes

Performance Evaluation

Quantified Score

Hi-index	0.09

Visualization

Abstract

A large variety of product-form solutions for continuous-time Markovian models can be derived by checking a set of structural properties of the underlying stochastic processes and a condition on their reversed rates. In previous work (Marin and Vigliotti (2010) [9]) we have shown how to derive a large class of product-form solutions using a different formulation of the Reversed Compound Agent Theorem (GRCAT). We continue this line of work by showing that it is possible to exploit this result to approximate the steady-state distribution of non-product-form model interactions by means of product-form ones.