Queues as Harris recurrent Markov chains
type: Item
instance of: scholarly article
title: Queues as Harris recurrent Markov chains
zbMATH Open document ID: 0652.60096
DOI: 10.1007/BF01189048
author: Karl Sigman
published in: Queueing Systems
publication date: 1988-01-01T00:00:00Z
review text: We present a framework for representing a queue at arrival epochs as a Harris recurrent Markov chain (HRMC). The input to the queue is a marked point process governed by a HRMC and the queue dynamics are formulated by a general recursion. Such inputs include the cases of i.i.d., regenerative, Markov modulated, Markov renewal and the output from some queues as well. Since a HRMC is regenerative, the queue inherits the regenerative structure. As examples, we consider split \& match, tandem, G/G/c and more general skip forward networks. In the case of i.i.d. input, we show the existence of regeneration points for a Jackson type open network having general service and interarrival time distributions.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60G55
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4064216
zbMATH Keywords: Harris recurrent Markov chain
zbMATH Keywords: marked point process
zbMATH Keywords: regenerative structure
MaRDI profile type: MaRDI publication profile
cites work: Q3026011
cites work: A Markov chain approach to periodic queues
cites work: A New Approach to the Limit Theory of Recurrent Markov Chains
cites work: An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals
cites work: Irr�ductibilit� et r�currence au sens de Harris des �Temps d'attente? des files GI/G/q
cites work: Estimation of steady-state central moments by the regenerative method of simulation
cites work: The Relation between Customer and Time Averages in Queues
cites work: On the Theory of Queues With Many Servers
cites work: Q5602045
cites work: Time and customer processes in queues with stationary inputs
cites work: A formal approach to queueing processes in the steady state and their applications
cites work: The derivation of invariance relations in complex queueing systems with stationary inputs
cites work: Q3923308
cites work: A splitting technique for Harris recurrent Markov chains
cites work: A conservation property for general GI/G/1 queues with an application to tandem queues
cites work: Regeneration in tandem queues
cites work: General Irreducible Markov Chains and Non-Negative Operators
cites work: Q3746634
cites work: Regeneration in tandem queues with multiserver stations
cites work: Conditions for Finite Ladder Height and Delay Moments
cites work: Sample-path derivations of the excess, age, and spread distributions
full work available at URL: https://doi.org/10.1007/bf01189048
OpenAlex ID: W2026965983
Recommended article: Wide-sense regeneration for Harris recurrent Markov processes: an open problem
Recommended article: Recurrence and regeneration in non-markovian networks of queues
Recommended article: A Markov chain approach to periodic queues
Recommended article: On queues with periodic inputs
Recommended article: The stability of open queueing networks
description: scientific article; zbMATH DE number 4064216