Numerical method for discrete-time finite-buffer queues with some regenerative structure
From MaRDI portal
Publication:4532394
DOI10.1081/STM-120002773zbMath1001.60096MaRDI QIDQ4532394
Publication date: 15 December 2002
Published in: Stochastic Models (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Queueing systems with vacations - a survey
- Loss probability in a finite discrete-time queue in terms of the steady state distribution of an infinite queue
- ON TRUNCATION PROPERTIES OF FINITE-BUFFER QUEUES AND QUEUEING NETWORKS
- Finite Markov chain models skip-free in one direction
- A Queue with Service Interruptions in an Alternating Random Environment
- Regenerative Analysis and Steady State Distributions for Markov Chains
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- Representation Theory for Denumerable Markov Chains
This page was built for publication: Numerical method for discrete-time finite-buffer queues with some regenerative structure