Long-range dependence - Ten years of Internet traffic modeling

Department of Computer Science and Engineering, University of California, Riverside, Riverside, California, United States
IEEE Internet Computing (Impact Factor: 2). 10/2004; 8(5):57- 64. DOI: 10.1109/MIC.2004.46
Source: IEEE Xplore

ABSTRACT Self-similarity and scaling phenomena have dominated Internet traffic analysis for the past decade. With the identification of long-range dependence (LRD) in network traffic, the research community has undergone a mental shift from Poisson and memory-less processes to LRD and bursty processes. Despite its widespread use, though, LRD analysis is hindered by the difficulty of actually identifying dependence and estimating its parameters unambiguously. The authors outline LRD findings in network traffic and explore the current lack of accuracy and robustness in LRD estimation. In addition, they present recent evidence that packet arrivals appear to be in agreement with the Poisson assumption in the Internet core.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this study, Change Making Problem (CMP) and Subset-Sum Problem (SSP), which can arise, in practice, in some classes of one dimensional cargo loading and cutting stock problems, are researched. These problems are often used in computer science, as well. CMP and SSP are NP-hard problems and these problems can be seen as types of the knapsack problem in some ways. The complementary problems for the change making problem and the subset-sum problem are defined in this study, and it is aimed to examine the CMP and SSP by means of the complementary problems.
    Third International Conference on Computational Science, Engineering and Information Technology, Konya Turkey; 06/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The Marcinkiewicz Strong Law, lim n→∞ 1 n 1 p n ∑ k=1 (D k − D) = 0 a.s. with p ∈ (1, 2), is studied for outer products D k = X k X T k , where {X k }, {X k } are both two-sided (multivariate) linear processes (with coefficient matrices (C l), (C l) and i.i.d. zero-mean innovations {Ξ}, {Ξ}). Matrix sequences C l and C l can decay slowly enough (as |l| → ∞) that {X k , X k } have long-range dependence while {D k } can have heavy tails. In particular, the heavy-tail and long-range-dependence phenomena for {D k } are handled simultaneously and a new decoupling property is proved that shows the convergence rate is determined by the worst of the heavy-tails or the long-range dependence, but not the combination. The main result is applied to obtain Marcinkiewicz Strong Law of Large Numbers for stochastic approximation, non-linear functions forms and autocovariances.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Almost sure convergence rates for linear algorithms $h_{k+1} = h_k +\frac{1}{k^\chi} (b_k-A_kh_k)$ are studied, where $\chi\in(0,1)$, $\{A_{k}\}_{k=1}^\infty$ are symmetric, positive semidefinite random matrices and $\{b_{k}\}_{k=1}^\infty$ are random vectors. It is shown that $|h_n- A^{-1}b|=o(n^{-\gamma})$ a.s. for the $\gamma\in[0,\chi)$, positive definite $A$ and vector $b$ such that $\frac{1}{n^{\chi-\gamma}}\sum\limits_{k=1}^n (A_{k}- A)\to 0$ and $\frac{1}{n^{\chi-\gamma}}\sum\limits_{k=1}^n (b_k-b)\to 0$ a.s. When $\chi-\gamma\in\left(\frac12,1\right)$, these assumptions are implied by the Marcinkiewicz strong law of large numbers, which allows the $\{A_k\}$ and $\{b_k\}$ to have heavy-tails, long-range dependence or both. Finally, corroborating experimental outcomes and decreasing-gain design considerations are provided.


Available from