Loading...
Loading...

Go to the content (press return)

A lightweight algorithm for traffic filtering over sliding windows

Author
Sanjuas, J.; Barlet, P.; Solé-Pareta, J.; Andriuzzi, G.
Type of activity
Presentation of work at congresses
Name of edition
2012 IEEE International Conference on Communications
Date of publication
2012
Presentation's date
2012-06
Book of congress proceedings
IEEE International Conference on Communications (ICC 2012): Ottawa, Ontario, Canada, 10-15 June 2012
First page
1171
Last page
1176
DOI
https://doi.org/10.1109/ICC.2012.6363985 Open in new window
Repository
http://hdl.handle.net/2117/19521 Open in new window
URL
http://ieeexplore.ieee.org/xpl/abstractAuthors.jsp?reload=true&arnumber=6363985 Open in new window
Abstract
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...
Citation
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.
Keywords
Accuracy, Data structures, Maintenance engineering, Memory management, Monitoring, Radiation detectors, Time measurement
Group of research
CBA - Communications and Broadband Architectures Lab
CCABA - Advanced Broadband Communications Center

Participants

  • Sanjuas Cuxart, Josep  (author and speaker )
  • Barlet Ros, Pere  (author and speaker )
  • Sole Pareta, Josep  (author and speaker )
  • Andriuzzi, Gabriella  (author and speaker )