Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
From MaRDI portal
Publication:940932
DOI10.1007/s10479-008-0317-2zbMath1151.90005OpenAlexW1984607595MaRDI QIDQ940932
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0317-2
Markov chain Monte Carloqueueing networkproduct form solutionperfect simulationfully polynomial-time randomized approximation scheme
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
- On queueing network models of flexible manufacturing systems
- Loss networks
- An interruptible algorithm for perfect sampling via Markov chains
- Polynomial-time counting and sampling of two-rowed contingency tables
- Condensation in large closed Jackson networks
- Polynomial time perfect sampling algorithm for two-rowed contingency tables
- Realization probability and throughput sensitivity in a closed jackson network
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Towards a polynomial-time randomized algorithm for closed product-form networks
- Asymptotically optimal importance sampling for product-form queuing networks
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to couple from the past using a read-once source of randomness
- Algorithms and Computation
- Probability and Computing
- Closed Queuing Systems with Exponential Servers
- Computational algorithms for closed queueing networks with exponential servers
This page was built for publication: Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
