Analysis of an algorithm catching elephants on the Internet

Abstract : The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper), able to treat on-line a huge amount of flows with high traffic variations. An analysis of a simplified model estimates the number of false positives. Limit theorems for the Markov chain that describes the algorithm for large filters are rigorously obtained. The asymptotic behavior of the stochastic model is here deterministic. The limit has a nice formulation in terms of a $M/G/1/C$ queue, which is analytically tractable and which allows to tune the algorithm optimally.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01194674
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, September 7, 2015 - 12:50:57 PM
Last modification on : Wednesday, May 15, 2019 - 3:44:52 AM
Long-term archiving on : Tuesday, December 8, 2015 - 11:27:20 AM

File

dmAI0119.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01194674, version 1

Citation

Yousra Chabchoub, Christine Fricker, Frédéric Meunier, Danielle Tibi. Analysis of an algorithm catching elephants on the Internet. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.295-310. ⟨hal-01194674⟩

Share

Metrics

Record views

647

Files downloads

333