2000
DOI: 10.1016/s0166-5316(99)00070-x
|View full text |Cite
|
Sign up to set email alerts
|

Use of α-stable self-similar stochastic processes for modeling traffic in broadband networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
29
0
1

Year Published

2001
2001
2018
2018

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(32 citation statements)
references
References 31 publications
2
29
0
1
Order By: Relevance
“…An α-stable CDF can be computed as the cumulative sum of the corresponding PDF. This approach has been used by researchers in several fields where α-stable PDFs are needed (see [11], for instance). Mittnik et al [18] propose a detailed algorithm to compute α-stable densities using this approach which is O (n log 2 n), with n a sufficiently large number of points to be calculated.…”
Section: Characteristic Function Of α-Stable Random Variablesmentioning
confidence: 99%
See 1 more Smart Citation
“…An α-stable CDF can be computed as the cumulative sum of the corresponding PDF. This approach has been used by researchers in several fields where α-stable PDFs are needed (see [11], for instance). Mittnik et al [18] propose a detailed algorithm to compute α-stable densities using this approach which is O (n log 2 n), with n a sufficiently large number of points to be calculated.…”
Section: Characteristic Function Of α-Stable Random Variablesmentioning
confidence: 99%
“…Now, let the three vertices of the found containing triangle be located at (α 1 , β 1 ), (α 2 , β 2 ) and (α 3 , β 3 ). In each of these vertices, an α-stable density has been previously approximated and tabulated with a tolerance of Q x , as described in (11) where w i , i ∈ {1, 2, 3}, are the respective weights of each neighboring precalculated density.…”
Section: Fast Computation Of α-Stable Densitiesmentioning
confidence: 99%
“…The latter two groups include certain self-similar processes, in particular, those governed by fractional Brownian motion [23], but do not extend to heavy-tailed distributions. There are also efforts for extending the network calculus to heavy-tailed distributions [12], [13], [16], [17], which are discussed in more detail in the next section.…”
Section: Introductionmentioning
confidence: 99%
“…denote the aggregated network traffic, defined as number of packets arriving per unit time [1]. The characteristic function of S(t) can be calculated [5]:…”
mentioning
confidence: 99%
“…Considering that the impulsive nature is determined by the low frequency components (|v| ≪ 1) of the characteristic function, we consider the expansion of the above formula (8) around v 0, as in [4,5], and then we obtain…”
mentioning
confidence: 99%