Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T23:18:07.072Z Has data issue: false hasContentIssue false

Two servers in series, studied in terms of a Markov renewal branching process

Published online by Cambridge University Press:  01 July 2016

Marcel F. Neuts*
Affiliation:
Cornell University and Purdue University

Abstract

This paper discusses the transient and limiting behavior of a system of queues, consisting of two service units in tandem in which the second unit has finite capacity. When the second unit reaches full capacity, a phenomenon termed “blocking” occurs. A wide class of rules to resolve blocking is defined and studied in a unified way.

The input to the first unit is assumed to be Poisson, the service times in the first unit are independent with a general, common distribution. When the system is not blocked, the second unit releases its customers according to a state-dependent, death process.

The analysis of the time-dependence relies heavily on several imbedded Markov renewal processes. In particular, the analog of the busy period for the M/G/1 queue is modeled here as a “Markov renewal branching process”. The study of this process requires the definition of a class of matrix functions which generalizes some classical definitions of matrix function. In terms of these “matrix functions” we are led to consider functional iterates and a matrix analog of Takács' functional equation for the transform of the distribution of the busy period in the M/G/1 model.

We further discuss the joint distribution of the queue lengths in units I and II and its marginal and limiting distributions.

A final section is devoted to an informal discussion on how the numerical analysis of this system of queues may be organized.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 

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