Loading...
Please wait, while we are loading the content...
Similar Documents
Etaqa-mg1: an efficient technique for the analysis of m/g/1-type processes by aggregation.
| Content Provider | CiteSeerX |
|---|---|
| Author | Ciardo, Gianfranco Mao, Weizhen Riska, Alma Smirni, Evgenia |
| Abstract | We extend the ETAQA approach, initially proposed for the efficient numerical solution of a class of quasi birth-death processes, to the more complex case of M/G/1-type Markov processes. The new technique is numerically stable and can be used for the exact solution of a class of M/G/1-type models by computing the solution of a finite linear system. We further demonstrate the utility of the method by describing the exact computation of an extensive set of Markov reward functions which include the expected queue length or its higher moments. We also provide an algorithm that finds an appropriate state reordering satisfying our applicability conditions, if one such order exists. We illustrate the method, discuss its complexity, and present comparisons with other traditional techniques. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Efficient Technique 1-type Process Efficient Numerical Solution New Technique Present Comparison Order Exists Applicability Condition Traditional Technique Exact Solution Markov Reward Function Complex Case Exact Computation Appropriate State Etaqa Approach 1-type Model Expected Queue Length Quasi Birth-death Process 1-type Markov Process Extensive Set Finite Linear System |
| Content Type | Text |
