Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A lightweight algorithm for traffic filtering over sliding windows

Autor
Sanjuas, J.; Barlet, P.; Solé-Pareta, J.; Andriuzzi, G.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
2012 IEEE International Conference on Communications
Any de l'edició
2012
Data de presentació
2012-06
Llibre d'actes
IEEE International Conference on Communications (ICC 2012): Ottawa, Ontario, Canada, 10-15 June 2012
Pàgina inicial
1171
Pàgina final
1176
DOI
https://doi.org/10.1109/ICC.2012.6363985 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/19521 Obrir en finestra nova
URL
http://ieeexplore.ieee.org/xpl/abstractAuthors.jsp?reload=true&arnumber=6363985 Obrir en finestra nova
Resum
The problem of testing whether a packet belongs to a set of filtered addresses has been traditionally addressed using Bloom filters. They have a small memory footprint and require few memory accesses per query and insertion, while presenting a small probability of false positive. The problem of automatic eviction of filtered addresses after a pre-configured time window is more challenging, since it requires tracking insertion times for later removal. This has been achieved in the literature by r...
Citació
Sanjuas, J. [et al.]. A lightweight algorithm for traffic filtering over sliding windows. A: IEEE International Conference on Communications. "IEEE International Conference on Communications (ICC 2012): Ottawa, Ontario, Canada, 10-15 June 2012". 2012, p. 1171-1176.
Paraules clau
Accuracy, Data structures, Maintenance engineering, Memory management, Monitoring, Radiation detectors, Time measurement
Grup de recerca
CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla
CCABA - Centre de Comunicacions Avançades de Banda Ampla

Participants