Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Introduction to queueing networks
Introduction to queueing networks
Spectral transforms for large boolean functions with applications to technology mapping
DAC '93 Proceedings of the 30th international Design Automation Conference
Performance and reliability analysis of computer systems: an example-based approach using the SHARPE software package
Capacity planning for Web performance: metrics, models, and methods
Capacity planning for Web performance: metrics, models, and methods
Using the exact state space of a Markov model to compute approximate stationary measures
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
PhFit: A General Phase-Type Fitting Tool
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
A Data Structure for the Efficient Kronecker Solution of GSPNs
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
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
The scale factor: a new degree of freedom in phase-type approximation
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Approximate Computation of Transient Results for Large Markov Chains
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
Fluid Flow Approximation of PEPA models
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Approximate Analysis of Stochastic Models by Self-Correcting Aggregation
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Approximating passage time distributions in queueing models by Bayesian expansion
Performance Evaluation
Specification and simulation of queuing network models using Domain-Specific Languages
Computer Standards & Interfaces
| Hi-index | 0.00 |
In this paper we present a new algorithm for the approximate transient analysis of large stochastic models. The new algorithm is based on the self-correcting analysis principle for continuous-time Markov chains (CTMC). The approach uses different time dependent aggregations of the CTMC of a stochastic model. With the method of uniformization the transient state probabilities of each aggregated CTMC for a time step are calculated. The derived probabilities are used for the construction of stronger aggregations, which are applied for the correction of the transition rates of the previous aggregations. This is done step by step, until the final time is reached. High aggregations of the original continuous-time Markov chain lead to a time and space efficient computational effort. Therefore the approximate transient analysis method based on the self-correcting aggregation can be used for models with large state spaces. For queuing networks with phase-type distributions of the service times this newly developed algorithm is implemented in WinPEPSY-QNS, a tool for performance evaluation and prediction of stochastic models based on queuing networks. It consists of a graphical editor for the construction of queuing networks and an easy-to-use evaluation component, which offers suitable analysis methods. The newly implemented algorithm is used for the analysis of several examples, and the results are compared to the results of simulation runs where exact values cannot be achieved.