Approximate Mean Value Analysis based on Markov Chain Aggregation by Composition

Markovian performance models are impractical for large systems because their state space grows very rapidly with the system size. This paper derives an approximate Mean Value Analysis (AMVA) solution for Markov models that represent a composition of subsystems. The goal is robust scalable analytical approximation. The approach taken here is to create approximate aggregated Markov chain submodels, each representing a view of the Markov chain for the entire system from the perspective of a selected set D of tagged components, and to derive mean value equations from them. The analytic solutions of submodels are then combined using system-level relationships, which must be identified for each system; this is not automatic but is usually straightforward. The first point of novelty is the method used to create the aggregate submodels for different sets D, building up each submodel by composition of the components in D rather than by aggregating the entire state space. Another point of novelty is the use of partitioned Markov models to obtain analytic solutions.

[1]  Stephen Gilmore,et al.  The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling , 1994, Computer Performance Evaluation.

[2]  Dorina C. Petriu,et al.  Approximate MVA for client-server systems with nonpreemptive priority , 1995, MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[3]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[4]  Marco Ajmone Marsan,et al.  Generalized Stochastic Petri Nets: A Definition at the Net Level and Its Implications , 1993, IEEE Trans. Software Eng..

[5]  C. Murray Woodside,et al.  Effectiveness of Early Replies in Client-Server Systems , 1999, Perform. Evaluation.

[6]  Holger Hermanns,et al.  Compositional performance modelling with the TIPPtool , 2000, Perform. Evaluation.

[7]  Dorina C. Petriu Approximate Mean Value Analysis of Client-Server Systems with Multi-class Requests , 1994, SIGMETRICS.

[8]  Charles E. Skinner,et al.  A Priority Queuing System with Server-Walking Time , 1967, Oper. Res..

[9]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[10]  Dorina C. Petriu,et al.  Applying performance modelling to a telecommunication system , 1998, WOSP '98.

[11]  C. Murray Woodside Throughput Calculation for Basic Stochastic Rendezvous Networks , 1989, Perform. Evaluation.

[12]  Shikharesh Majumdar,et al.  The Stochastic Rendezvous Network Model for Performance of Synchronous Client-Server-like Distributed Software , 1995, IEEE Trans. Computers.

[13]  J. Banks,et al.  Discrete-Event System Simulation , 1995 .

[14]  Dorina C. Petriu,et al.  Approximate MVA from Markov model of software client/server systems , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[15]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[16]  Dorina C. Petriu,et al.  Approximate solution for stochastic rendezvous networks by Markov chain task-directed aggregation , 1991 .

[17]  W. Stewart,et al.  The numerical solution of stochastic automata networks , 1995 .

[18]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[19]  Gunter Bolch,et al.  Queueing Networks and Markov Chains , 2005 .