Hitting times of Markov chains, with application to state-dependent queues

DOI10.1017/S0004972700025508zbMATH Open0363.60047MaRDI QIDQ4137841FDOQ4137841

Authors: R. L. Tweedie 

Publication date: 1977

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Discrete-time Markov processes on general state spaces (60J05)

Cites Work

• Sufficient conditions for ergodicity and recurrence of Markov chains on a general state space
• On the Stochastic Matrices Associated with Certain Queuing Processes
• Some Conditions for Ergodicity and Recurrence of Markov Chains
• Title not available (Why is that?)
• Criteria for classifying general Markov chains
• Single-Server Queues with Service Time Dependent on Waiting Time
• A queue with waiting time dependent service times

Cited In (2)

• First-passage times in skip-free processes
• Value iteration in countable state average cost Markov decision processes with unbounded costs

This page was built for publication: Hitting times of Markov chains, with application to state-dependent queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4137841)