Efficiency of simulation in monotone hyper-stable queueing networks

DOI10.1007/s11134-013-9357-7zbMath1307.60123OpenAlexW2072390871MaRDI QIDQ475076

Bruno Gaujal, Jonatha Anselmi

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

simulationfinite buffermixing timecoupling timeJackson queueing networks

Mathematics Subject Classification ID

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

Related Items (1)

Perfect sampling of Jackson queueing networks

Cites Work

• Unnamed Item
• Unnamed Item
• Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
• Transient behavior of the M/M/1 queue: Starting at the origin
• An operator-analytic approach to the Jackson network
• Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers
• Efficiency of Time Segmentation Parallel Simulation of Finite Markovian Queueing Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Markov Chains
• Towards a polynomial-time randomized algorithm for closed product-form networks
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Queueing Networks and Markov Chains
• An introduction to queueing theory. Modeling and analysis in applications.
• Analysis of queueing networks with blocking

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