A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Bitmap algorithms for counting active flows on high speed links
2003
Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03
This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high speed link. Such counting can be used to detect DoS attacks and port scans, and to solve measurement problems. Counting is especially hard when processing must be done within a packet arrival time (8 nsec at OC-768 speeds) and, hence, must require only a small number of accesses to limited, fast memory. A naive solution that maintains a hash table
doi:10.1145/948205.948225
dblp:conf/imc/EstanVF03
fatcat:s5bgycujqff4jaxzjtmy4pvxle