Analysis of an algorithm catching elephants on the Internet - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2008

Analysis of an algorithm catching elephants on the Internet

Résumé

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.
Fichier principal
Vignette du fichier
dmAI0119.pdf (233.67 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01194674 , version 1 (07-09-2015)

Identifiants

Citer

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, ⟨10.46298/dmtcs.3572⟩. ⟨hal-01194674⟩
338 Consultations
546 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More