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

DOI10.1017/S0004972700025508zbMath0363.60047MaRDI QIDQ4137841

Richard L. Tweedie

Publication date: 1977

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

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

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

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