A fast simulation model based on Lindley's recursion for the G/G/1/K queue
From MaRDI portal
Publication:2298302
DOI10.1155/2019/3464389zbMath1435.90049OpenAlexW2966670444MaRDI QIDQ2298302
R. Sanchez-Lara, Agustin Perez-Ramirez, R. Sandoval-Arechiga, J. L. Vazquez-Avila, Y. El Hamzaoui, Homero Toral-Cruz
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/3464389
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of wavelet analysis and data extraction from second-order self-similar time series
- Properties and performance modelling of finite buffer \(M/G/1/K\) networks
- A recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup time
- Asymptotic behaviour of the loss probability of the \(M/G/1/K\) and \(G/M/1/K\) queues
- Traffic intensity estimation in finite Markovian queueing systems
- Optimal design and performance modelling of \(M/G/1/K\) queueing systems
- Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach
- Analysis of the optimal resource allocation for a tandem queueing system
- Accurate modeling of VoIP traffic QoS parameters in current and future networks with multifractal and Markov models
- Performance Analysis of Queuing and Computer Networks
- Generalized Lindley-type recursive representations for multiserver tandem queues with blocking
- Self-similar processes in communications networks
- A Recurrent Solution of PH/M/c/N-Like and PH/M/c-Like Queues
This page was built for publication: A fast simulation model based on Lindley's recursion for the G/G/1/K queue
