Analyzing a Bloom Filter Algorithm via a join-the-shortest-queue queuing system

Yousra Chabchoub (1, 2) , Christine Fricker (1) , Hanene Mohamed (1, 3)

1 RAP - Networks, Algorithms and Probabilities
2 BILab - Laboratoire de Business Intelligence Télécom-ParisTech/EDF
3 MODAL'X - Modélisation aléatoire de Paris X

This paper deals with the problem of identifying elephants in the Internet Traffic. The aim is to analyze a new adaptive algorithm based on a Bloom Filter. This algorithm uses a so-called min-rule which can be described as in the supermarket model. This model consists of joining the shortest queue among d queues selected at random in a large number of m queues. In case of equality, one of the shortest queues is chosen at random. An analysis of a simplified model gives an insight into the error generated by the algorithm for the estimation of the number of the elephants. The main conclusion is that, as m gets large, there is a deterministic limit for the empirical distribution of the filter counters. Limit theorems are proved and the limit is identified. It depends on key parameters. The condition for the algorithm to perform well is discussed. Theoretical results are validated by experiments on a trac trace from France Telecom and by simulations.

Domaines: Algorithme et structure de données [cs.DS]

Yousra Chabchoub, Christine Fricker, Hanene Mohamed. Analyzing a Bloom Filter Algorithm via a join-the-shortest-queue queuing system. 2009. ⟨hal-00465304⟩