Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T17:25:50.857Z Has data issue: false hasContentIssue false

Moment formulas for the Markov renewal branching process

Published online by Cambridge University Press:  01 July 2016

Marcel F. Neuts*
Affiliation:
Purdue University

Abstract

There are many queueing models in which there appears a semi-Markov matrix G(·), whose entries are absorption-time distributions in a Markov renewal branching process. The role of G(·) is similar to that of the busy period in the simple M/G/1 model. The computation of various quantities associated with G(·) is however much more complicated. The moment matrices, and particularly the mean matrix of G(·), are essential in the construction of general and mathematically well-justified algorithms for the steady-state distributions of such queues.

This paper discusses the moment matrices of G(·) and algorithms for their numerical computation. Its contents are basic to the algorithmic solutions to several queueing models, which are to be presented in follow-up papers.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1976 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable