Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers

DOI10.1007/S10479-008-0317-2MaRDI QIDQ940932zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Markov chain Monte Carlofully polynomial-time randomized approximation schemeperfect simulationqueueing networkproduct form solution

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic network models in operations research (90B15)

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

Cites work

• scientific article; zbMATH DE number 1566488 (Why is no real title available?)
• scientific article; zbMATH DE number 4068014 (Why is no real title available?)
• scientific article; zbMATH DE number 1324228 (Why is no real title available?)
• scientific article; zbMATH DE number 1545677 (Why is no real title available?)
• scientific article; zbMATH DE number 1885142 (Why is no real title available?)
• Algorithms and Computation
• An interruptible algorithm for perfect sampling via Markov chains
• Asymptotically optimal importance sampling for product-form queuing networks
• Closed Queuing Systems with Exponential Servers
• Computational algorithms for closed queueing networks with exponential servers
• Condensation in large closed Jackson 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
• Loss networks
• Mean-Value Analysis of Closed Multichain Queuing Networks
• On queueing network models of flexible manufacturing systems
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
• Polynomial time perfect sampling algorithm for two-rowed contingency tables
• Polynomial-time counting and sampling of two-rowed contingency tables
• Probability and Computing
• Realization probability and throughput sensitivity in a closed jackson network
• Towards a polynomial-time randomized algorithm for closed product-form networks

Cited in

(3)

• Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers
• Perfect sampling of Jackson queueing networks
• Efficiency of simulation in monotone hyper-stable queueing networks

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)