SearcharxivSearch

arXiv · 1011.5104

On the superposition of heterogeneous traffic at large time scales

Abstract

Various empirical and theoretical studies indicate that cumulative network traffic is a Gaussian process. However, depending on whether the intensity at which sessions are initiated is large or small relative to the session duration tail, Mikosch et al. (Ann Appl Probab, 12:23-68, 2002) and Kaj and Taqqu (Progress Probab, 60:383-427, 2008) have shown that traffic at large time scales can be approximated by either fractional Brownian motion (fBm) or stable Levy motion. We study distributional properties of cumulative traffic that consists of a finite number of independent streams and give an explanation of why Gaussian examples abound in practice but not stable Levy motion. We offer an explanation of how much vertical aggregation is needed for the Gaussian approximation to hold. Our results are expressed as limit theorems for a sequence of cumulative traffic processes whose session initiation intensities satisfy growth rates similar to those used in Mikosch et al. (Ann Appl Probab, 12:23-68, 2002).

Explore related subjects

Keep this discovery

BibTeXRIS

Luis Lopez-Oliveros, Sidney I. Resnick. 2010-12-06. On the superposition of heterogeneous traffic at large time scales. https://arxiv.org/abs/1011.5104

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR