A Markov Chain Description of A Workstation with Infinite Capacity

DOI10.1080/0233193031000079847MaRDI QIDQ4430669zbMATH OpenOpenAlexFDO

Authors Wolfgang Stadje

Publication date 12 October 2003

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0233193031000079847

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Case-oriented studies in operations research (90B90)

Recommendations

• A completely stationary Markov chain with infinite state space
• A Simple Numerical Approach for Infinite-State Markov Chains
• A Markov-modulated M/G/1 queue. I: Stationary distribution
• A single-server finite-capacity queueing system with Markov flow and discrete-time service
• A finite queue with a Markov input dependent on the state of the system and a random service discipline

Cites work

• Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues
• Delay analysis for discrete-time queueing systems with multiple randomly interrupted servers
• Deriving delay characteristics from queue length statistics in discrete-time queues with multiple servers
• On the queueing system
• The queueing system B_DG D_∞^∗∗

This page was built for publication: A Markov Chain Description of A Workstation with Infinite Capacity

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