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

DOI10.1017/S0004972700025508MaRDI QIDQ4137841zbMATH OpenFDO

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

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

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)