LOGLOG counting for the estimation of IP traffic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

LOGLOG counting for the estimation of IP traffic


In this paper, we discuss the problem of estimating the number of "elephants'' in a stream of IP packets. First, the problem is formulated in the context of multisets. Next, we explore some of the theoretical space complexity of this problem, and it is shown that it cannot be solved with less than $\Omega (n)$ units of memory in general, $n$ being the number of different elements in the multiset. Finally, we describe an algorithm, based on Durand-Flajolet's LOGLOG algorithm coupled with a thinning of the packet stream, which returns an estimator of the number of elephants using a small amount of memory. This algorithm allows a good estimation for particular families of random multiset. The mean and variance of this estimator are computed. The algorithm is then tested on synthetic data.
Fichier principal
Vignette du fichier
dmAG0105.pdf (246.26 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184707 , version 1 (17-08-2015)



Olivier Gandouet, Alain Jean-Marie. LOGLOG counting for the estimation of IP traffic. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.119-128, ⟨10.46298/dmtcs.3503⟩. ⟨hal-01184707⟩
363 View
426 Download



Gmail Facebook Twitter LinkedIn More