scispace - formally typeset
Open AccessJournal ArticleDOI

Bridging ETAQA and Ramaswami's formula for the solution of M/G/1-type processes

Reads0
Chats0
TLDR
A new formulation is derived that improves the numerical stability and computational performance of ETAQA and shows that the new method is just an efficient way to implement Ramaswami's method.
About
This article is published in Performance Evaluation.The article was published on 2005-10-01 and is currently open access. It has received 10 citations till now. The article focuses on the topics: Matrix analytic method & Numerical stability.

read more

Figures
Citations
More filters
Posted Content

Clearing Analysis on Phases: Exact Limiting Probabilities for Skip-free, Unidirectional, Quasi-birth-death Processes

TL;DR: In this paper, the authors present a procedure called clearing analysis on phases (CAP) for determining the limiting probabilities of Markov chains with skip-free and unidirectional transitions.
Journal ArticleDOI

A conditional probability approach to M/G/1-like queues

TL;DR: This paper considers an M/G/1-like system in which the service time distribution is represented by a Coxian series of memoryless stages, and presents a novel approach to the solution of such systems.
Journal ArticleDOI

Clearing Analysis on Phases: Exact Limiting Probabilities for Skip-Free, Unidirectional, Quasi-Birth-Death Processes

TL;DR: In this article, the authors present a procedure, called clearing analysis on phases (CAP), for determining the limiting probabilities of infinite repeating Markov chains with an infinite number of levels and a finite number of phases.
Journal ArticleDOI

ETAQA Solutions for Infinite Markov Processes with Repetitive Structure

TL;DR: The proposed ETAQA approach for the exact analysis of M/G/1 and GI/M/1-type processes, and their intersection, compares favorably to the classic methods as shown by detailed time and space complexity analysis.
References
More filters
Book

Topics in Matrix Analysis

TL;DR: The field of values as discussed by the authors is a generalization of the field of value of matrices and functions, and it includes singular value inequalities, matrix equations and Kronecker products, and Hadamard products.
MonographDOI

Introduction to matrix analytic methods in stochastic modeling

TL;DR: This chapter discusses quasi-Birth-and-Death Processes, a large number of which are based on the Markovian Point Processes and the Matrix-Geometric Distribution, as well as algorithms for the Rate Matrix.
Book

Accuracy and stability of numerical algorithms

TL;DR: This book gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic by combining algorithmic derivations, perturbation theory, and rounding error analysis.
Book

Introduction to the Numerical Solution of Markov Chains

TL;DR: This document discusses Markov Chains, Direct Methods, Iterative Methods, and Projection Methods for Stochastic Automata Networks, as well as some of the techniques used to design and implement these systems.
Related Papers (5)
Frequently Asked Questions (1)
Q1. What are the contributions mentioned in the paper "Bridging etaqa and ramaswami’s formula for the solution of m/g/1-type processes" ?

In this paper, the authors derive a new formulation that improves the numerical stability and computational performance of ETAQA. In addition, the authors show that the matrix X is an M-matrix, and under certain conditions, X is also diagonally dominant and thus can be factored stably. More importantly, the authors show that the newETAQA method is just an efficient way to implement Ramaswami ’ s method. The authors also discuss alternative normalization conditions for Ramaswami ’ s method.