On the impact of retrials on traffic burstiness

Peakedness of an arrival process has been used as a measure of the process burstiness and it provides an effective method in approximating an autocorrelated process with a renewal process leading to simple loss and delay approximations in both single and multiple queue (node) environments. In this paper, we focus on the peakedness of processes generated in retrial queueing systems. More specifically, we derive a numerically efficient algorithm for the computation of the peakedness of the departure process of a single-server M/M/1 retrial queue. It is shown that the peakedness functional is a decreasing function of the retrial rate and its maximum is equal to 1 as the Poisson process.