Efficiency of simulation in monotone hyper-stable queueing networks

DOI10.1007/S11134-013-9357-7MaRDI QIDQ475076zbMATHOpenAlexFDO

Authors Jonatha Anselmi, Bruno Gaujal

Publication date 25 November 2014

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/20.500.11824/127

zbMATH Keywords

simulationmixing timefinite buffercoupling timeJackson queueing networks

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Perfect Sampling of Networks with Finite and Infinite Capacity Queues
• Perfect sampling of Jackson queueing networks
• Publication:4956079
• Efficiency of Time Segmentation Parallel Simulation of Finite Markovian Queueing Networks
• Stochastic Monotonicities in Jackson Queueing Networks

Cites work

• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• An introduction to queueing theory. Modeling and analysis in applications.
• An operator-analytic approach to the Jackson network
• Analysis of queueing networks with blocking
• Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers
• Comparison methods for stochastic models and risks
• Efficiency of Time Segmentation Parallel Simulation of Finite Markovian Queueing Networks
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Markov Chains
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Queueing Networks and Markov Chains
• Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
• Towards a polynomial-time randomized algorithm for closed product-form networks
• Transient behavior of the M/M/1 queue: Starting at the origin

Cited in

(4)

• Learning optimal admission control in partially observable queueing networks
• Perfect sampling of Jackson queueing networks
• Efficiency of Time Segmentation Parallel Simulation of Finite Markovian Queueing Networks
• Fast simulation of networks of queues with effective and decoupling bandwidths

This page was built for publication: Efficiency of simulation in monotone hyper-stable queueing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475076)