TY - JOUR
T1 - Buffer overflow simulation in self-similar queuing networks with finite buffer capacity
AU - Lokshina, Izabella V.
AU - Bartolacci, Michael R.
N1 - Publisher Copyright:
Copyright © 2014 Inderscience Enterprises Ltd.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2014/11/1
Y1 - 2014/11/1
N2 - The paper recommends an approach to estimate effectively probability of buffer overflow in self-similar queuing networks with finite buffer capacity. Simulations with stochastic (or long-range dependent) traffic source models are conducted. A new efficient algorithm, based on the RESTART method, is developed and applied to accelerate the buffer overflow simulation in a finite buffer single server model under long-range dependent self-similar traffic load with different buffer sizes. Numerical examples and simulation results are provided.
AB - The paper recommends an approach to estimate effectively probability of buffer overflow in self-similar queuing networks with finite buffer capacity. Simulations with stochastic (or long-range dependent) traffic source models are conducted. A new efficient algorithm, based on the RESTART method, is developed and applied to accelerate the buffer overflow simulation in a finite buffer single server model under long-range dependent self-similar traffic load with different buffer sizes. Numerical examples and simulation results are provided.
UR - http://www.scopus.com/inward/record.url?scp=84911212911&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84911212911&partnerID=8YFLogxK
U2 - 10.1504/IJMNDI.2014.065744
DO - 10.1504/IJMNDI.2014.065744
M3 - Article
AN - SCOPUS:84911212911
SN - 1744-2869
VL - 5
SP - 144
EP - 151
JO - International Journal of Mobile Network Design and Innovation
JF - International Journal of Mobile Network Design and Innovation
IS - 3
ER -