Methods of simulation queueing systems with heavy tails
DOI10.1007/978-3-319-44615-8_33zbMATH Open1398.60099OpenAlexW2507695095MaRDI QIDQ4690256FDOQ4690256
Authors: Vladimir N. Zadorozhnyi, Tatiana R. Zakharenkova
Publication date: 22 October 2018
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44615-8_33
Recommendations
Statistics of extreme values; tail inference (62G32) Queueing theory (aspects of probability theory) (60K25) Fractals (28A80)
Cites Work
Cited In (8)
- How heavy-tailed distributions affect simulation-generated time averages
- Estimation of prioritized disciplines efficiency based on the metamodel of multi-flows queueing systems
- Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
- Minimization of Packet Loss Probability in Network with Fractal Traffic
- Efficient simulation of tail probabilities in a queueing model with heterogeneous servers
- Heavy Tails in Queueing Systems: Impact of Parallelism on Tail Performance
- Infinite markings method in queueing systems with the infinite variance of service time
- The Queuiac: An Electromechanical Analog for the Simulation of Waiting-Line Problems
Uses Software
This page was built for publication: Methods of simulation queueing systems with heavy tails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690256)