Analysis of a Bloom Filter Algorithm via the Supermarket Model - Computer Science > Discrete MathematicsReportar como inadecuado




Analysis of a Bloom Filter Algorithm via the Supermarket Model - Computer Science > Discrete Mathematics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: This paper deals with the problem of identifying elephants in the InternetTraffic. The aim is to analyze a new adaptive algorithm based on a BloomFilter. This algorithm uses a so-called min-rule which can be described as inthe supermarket model. This model consists of joining the shortest queue amongd 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 simplifiedmodel gives an insight of the error generated by the algorithm on theestimation of the number of the elephants. The main conclusion is that, as mgets large, there is a deterministic limit for the empirical distribution ofthe filter counters. Limit theorems are proved and the limit is identified. Itdepends on key parameters. The condition for the algorithm to perform well isdiscussed. Theoretical results are validated by experiments on a traffic tracefrom France Telecom and by simulations.



Autor: Yousra Chabchoub, Christine Fricker, Hanene Mohamed

Fuente: https://arxiv.org/







Documentos relacionados