On truncation properties of finite-buffer queues and queueing networks
The authors consider censoring of a discrete-time stochastic process with respect to some region \(R\), defined by cutting off from the trajectories all parts not lying in \(R\). If the process is ergodic, then the censored process has as stationary distribution the truncated version of the original one. This idea is developed further for Markov chains with discrete time and, under a certain balance condition, also with continuous time. The results are then applied to \(\text{M}^k/\text{G}^Y/1/k\) queues and queueing networks with finite buffers and jump-over blocking, for which the truncation property of the stationary distribution can be proved.
- Truncation of Markov Chains with Applications to Queueing
- On the Effect of Finite Buffer Truncation in a Two-Node Jackson Network
- Two-sided truncations for a class of continuous-time Markov chains
- Perturbation bounds and truncations for a class of Markovian queues
- scientific article; zbMATH DE number 3974021
- Sample-path analysis of the proportional relation and its constant for discrete-time single-server queues
- Numerical method for discrete-time finite-buffer queues with some regenerative structure
- On the Effect of Finite Buffer Truncation in a Two-Node Jackson Network
- Queues with boundary assistance: The effects of truncation
This page was built for publication: On truncation properties of finite-buffer queues and queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2711559)
