A Fast Simulation Model Based on Lindley’s Recursion for the G/G/1/K Queue

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.

[1]  D. V. Lindley,et al.  The theory of queues with a single server , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  A. Brandwajn,et al.  A Recurrent Solution of PH/M/c/N-Like and PH/M/c-Like Queues , 2012, J. Appl. Probab..

[3]  MengChu Zhou,et al.  A model reduction method for traffic described by MMPP with unknown rate limit , 2006, IEEE Communications Letters.

[4]  Moshe Zukerman,et al.  Performance evaluation of a queue fed by a Poisson Pareto burst process , 2002, Comput. Networks.

[5]  N.D. Georganas,et al.  Self-Similar Processes in Communications Networks , 1998, IEEE Trans. Inf. Theory.

[6]  Ramón Parra-Michel,et al.  A fast discrete event simulation model for queueing network systems , 2015, SimuTools.

[7]  Moshe Zukerman,et al.  Broadband traffic modeling: simple solutions to hard problems , 1998, IEEE Commun. Mag..

[8]  Hod Lipson,et al.  Distilling Free-Form Natural Laws from Experimental Data , 2009, Science.

[9]  Jianbo Gao,et al.  Multiscale Analysis of Complex Time Series: Integration of Chaos and Random Fractal Theory, and Beyond , 2007 .

[10]  Thomas Begin,et al.  A Recurrent Solution of PH/M/c/N-Like and PH/M/c-Like Queues , 2012, Journal of Applied Probability.

[11]  Andrea Baiocchi,et al.  Asymptotic behaviour of the loss probability of theM/G/1/K andG/M/1/K queues , 1992, Queueing Syst. Theory Appl..

[12]  Jianbo Gao,et al.  Multiscale Analysis of Complex Time Series , 2007 .

[13]  Marco Ajmone Marsan,et al.  An MMPP-based hierarchical model of Internet traffic , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[14]  Homero Toral Cruz,et al.  A Study of Wavelet Analysis and Data Extraction from Second-Order Self-Similar Time Series , 2013 .

[15]  Wen Lea Pearn,et al.  (Applied Mathematical Modelling,32(6):958-970)A recursive method for the F policy G/M/1/K queueing system with an exponential startup time , 2008 .

[16]  Radu Marculescu,et al.  Non-Stationary Traffic Analysis and Its Implications on Multicore Platform Design , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Zaiming Liu,et al.  Analysis of the Optimal Resource Allocation for a Tandem Queueing System , 2017 .

[18]  G. R. Dattatreya,et al.  Performance Analysis of Queuing and Computer Networks , 2008 .

[19]  J. MacGregor Smith,et al.  Optimal design and performance modelling of M/G/1/K queueing systems , 2004 .

[20]  Moshe Zukerman,et al.  Resource Provisioning for a Multi-Layered Network , 2019, IEEE Access.

[21]  Abraham O. Fapojuwo,et al.  Stochastic processes for computer network traffic modeling , 2005, Comput. Commun..

[22]  Fan Wu,et al.  Hurst parameter estimation and characteristics analysis of aggregate wireless LAN traffic , 2005, Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005..

[23]  Oliver Rose,et al.  Estimation of the Hurst Parameter of Long-Range Dependent Time Series , 1996 .

[24]  Frederico R. B. Cruz,et al.  Traffic Intensity Estimation in Finite Markovian Queueing Systems , 2018, Mathematical Problems in Engineering.

[25]  Tho Le-Ngoc,et al.  A Pareto-modulated Poisson process (PMPP) model for long-range dependent traffic , 2000, Comput. Commun..

[26]  Al-Sakib Khan Pathan,et al.  Accurate modeling ofVoIP traffic in modern communication , 2019 .

[27]  James MacGregor Smith,et al.  Properties and performance modelling of finite buffer M/G/1/K networks , 2011, Comput. Oper. Res..

[28]  Al-Sakib Khan Pathan,et al.  Accurate modeling of VoIP traffic QoS parameters in current and future networks with multifractal and Markov models , 2013, Math. Comput. Model..

[29]  Jin Zhu,et al.  Modeling and Optimization of M/G/1-Type Queueing Networks: An Efficient Sensitivity Analysis Approach , 2010 .

[30]  Leopoldo Estrada Vargas,et al.  High-Performance Tool for the Test of Long-Memory and Self-Similarity , 2014 .

[31]  Victor Chan,et al.  Generalized Lindley-type recursive representations for multiserver tandem queues with blocking , 2010, TOMC.