On the impact of retrials on traffic burstiness

Author

Sohraby, K. ; Kiseon Kim

Author_Institution

Dept. of Comput. Sci. Electr. Eng., Univ. of Missouri-Kansas City, Kansas City, MO, USA

fYear

2013

fDate

14-16 May 2013

Firstpage

1

Lastpage

5

Abstract

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.

Keywords

queueing theory; stochastic processes; telecommunication traffic; Poisson process; autocorrelated process; numerically efficient algorithm; peakedness functional; renewal process; retrial queueing system; single server M-M-1 retrial queue system; traffic burstiness; Approximation methods; Equations; Mathematical model; Orbits; Queueing analysis; Random variables; Servers;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical Engineering (ICEE), 2013 21st Iranian Conference on

Conference_Location

Mashhad

Type

conf

DOI

10.1109/IranianCEE.2013.6599523

Filename

6599523