Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T11:07:31.283Z Has data issue: false hasContentIssue false

The substability and ergodicity of complicated queueing systems

Published online by Cambridge University Press:  14 July 2016

Toshinao Nakatsuka*
Affiliation:
Tokyo Metropolitan University
*
∗ Postal address: Faculty of Economics, Tokyo Metropolitan University, 1–1-1 Yakumo, Meguroku, Tokyo, Japan.

Abstract

The substability and the ergodicity of various queueing models are discussed. This paper considers the vector-valued queueing process Xrn = (xrn ,1,xrn ,2, · ··) with non-negative components and a constant initial value Xrr= a. For this, the substability is derived under simple conditions by showing the finiteness of With respect to the ergodicity, in order to make use of Borovkov's theorem, we additionally assume that the distribution of the interarrival of customers has non-bounded tail for any given past sequence.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1986 

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