Efficiency of simulation in monotone hyper-stable queueing networks
DOI10.1007/S11134-013-9357-7zbMATH Open1307.60123OpenAlexW2072390871MaRDI QIDQ475076FDOQ475076
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
Recommendations
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)
Cites Work
- Comparison methods for stochastic models and risks
- Title not available (Why is that?)
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Markov Chains
- Queueing Networks and Markov Chains
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- An introduction to queueing theory. Modeling and analysis in applications.
- Analysis of queueing networks with blocking
- 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
- Towards a polynomial-time randomized algorithm for closed product-form networks
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
Cited In (4)
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)
