A fast simulation model based on Lindley's recursion for the G/G/1/K queue

DOI10.1155/2019/3464389MaRDI QIDQ2298302zbMATH OpenOpenAlexFDO

Authors J. L. Vazquez-Avila, R. Sandoval-Arechiga, Agustin Perez-Ramirez, R. Sanchez-Lara, Y. El Hamzaoui, Homero Toral-Cruz

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/3464389

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Review text

Summary: There are many applications where it is necessary to model queuing systems that involve finite queue size. Most of the models consider traffic with Poisson arrivals and exponentially distributed service times. Unfortunately, when the traffic behavior does not consider Poisson arrivals and exponentially distributed service times, closed-form solutions are not always available or have high mathematical complexity. Based on Lindley's recursion, this paper presents a fast simulation model for an accurate estimation of the performance metrics of G/G/1/K queues. One of the main characteristics of this approach is the support for long-range dependence traffic models. The model can be used to model queuing systems in the same way that a discrete event simulator would do it. This model has a speedup of at least two orders of magnitude concerning implementations in conventional discrete event simulators.

Recommendations

• Fast simulation of queues with long-range dependent traffic
• Properties and performance modelling of finite buffer \(M/G/1/K\) networks
• Discrete time Geo/G/1 queue with Bernoulli gated service simulation system
• Massively time-parallel, approximate simulation of loss queueing systems
• FAST SIMULATION OF A QUEUE FED BY A SUPERPOSITION OF MANY (HEAVY-TAILED) SOURCES

Cites work

• A recurrent solution of PH/M/c/N-like and PH/M/c-like queues
• A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
• A study of wavelet analysis and data extraction from second-order self-similar time series
• Accurate modeling of VoIP traffic QoS parameters in current and future networks with multifractal and Markov models
• Analysis of the optimal resource allocation for a tandem queueing system
• Asymptotic behaviour of the loss probability of the \(M/G/1/K\) and \(G/M/1/K\) queues
• Fundamentals of queueing theory
• Generalized Lindley-type recursive representations for multiserver tandem queues with blocking
• scientific article; zbMATH DE number 5298306 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3072483 (Why is no real title available?)
• Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach
• Optimal design and performance modelling of M/G/1/K queueing systems
• Performance Analysis of Queuing and Computer Networks
• Properties and performance modelling of finite buffer \(M/G/1/K\) networks
• Self-similar processes in communications networks
• Traffic intensity estimation in finite Markovian queueing systems

Cited in

(1)

• Intelligent congestion control of data transmission in low Earth orbit satellite networks based on reinforcement learning: analysis and optimization

This page was built for publication: A fast simulation model based on Lindley's recursion for the G/G/1/K queue

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