Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8901021 | Applied Mathematics and Computation | 2018 | 14 Pages |
Abstract
We study the burst ratio in the queueing system with finite buffer and batch arrivals. The study is motivated by computer networking, in which packet losses occur due to queueing mechanisms and buffer overflows. First, we derive the formula for the burst ratio in the case of compound Poisson arrivals, general distribution of the service time and general distribution of the batch size. Then, we study its asymptotic behavior, as the buffer size grows to infinity. Using the obtained analytical solutions, we present several numerical examples with various batch size distributions, service time distributions, buffer sizes and system loads. Finally, we compare the computed burst ratios with values obtained in simulations.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Andrzej Chydzinski, Dominik Samociuk, Blazej Adamczyk,