A Markov Chain Description of A Workstation with Infinite Capacity
The paper considers a workstation with infinite operating capacity in which at any time instant \(n=0,1,2,\dots\) a new job arrives. Each of these jobs takes a truncated geometric time to be completed (independently of the others). The objective is to provide a comprehensive analysis of the evolution of this system in terms of the joint occupation states of all servers. The author introduces a Markov chain whose state space consists of some dyadic numbers in \((0,1]\) and gives its stationary distribution explicitly. A first-entrance problem of this Markov chain is also studied.
- 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
- 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 BDG 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)