Skip to Main content Skip to Navigation
Conference papers

LOGLOG counting for the estimation of IP traffic

Abstract : 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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184707
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 4:07:09 PM
Last modification on : Tuesday, November 13, 2018 - 2:38:01 AM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:09:55 PM

File

dmAG0105.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184707, version 1

Citation

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. ⟨hal-01184707⟩

Share

Metrics

Record views

612

Files downloads

573