Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
DOI10.1007/S10479-008-0317-2zbMATH Open1151.90005OpenAlexW1984607595MaRDI QIDQ940932FDOQ940932
Authors: Shuji Kijima, Tomomi Matsui 
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
Recommendations
- Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers
- Perfect sampling for infinite server and loss systems
- Perfect sampling of Jackson queueing networks
- Towards a polynomial-time randomized algorithm for closed product-form networks
- Perfect Sampling of Networks with Finite and Infinite Capacity Queues
Markov chain Monte Carlofully polynomial-time randomized approximation schemeperfect simulationqueueing networkproduct form solution
Queues and service in operations research (90B22) Stochastic network models in operations research (90B15)
Cites Work
- Condensation in large closed Jackson networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Loss networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability and Computing
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Title not available (Why is that?)
- Computational algorithms for closed queueing networks with exponential servers
- Closed Queuing Systems with Exponential Servers
- Title not available (Why is that?)
- An interruptible algorithm for perfect sampling via Markov chains
- Title not available (Why is that?)
- Towards a polynomial-time randomized algorithm for closed product-form networks
- Polynomial-time counting and sampling of two-rowed contingency tables
- Polynomial time perfect sampling algorithm for two-rowed contingency tables
- How to couple from the past using a read-once source of randomness
- Algorithms and Computation
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
- On queueing network models of flexible manufacturing systems
- Realization probability and throughput sensitivity in a closed jackson network
- Asymptotically optimal importance sampling for product-form queuing networks
Cited In (3)
This page was built for publication: Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q940932)
