Per flow packet sampling for high-speed network monitoring
- 1 January 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We present a per-flow packet sampling method that enables the real-time classification of high-speed network traffic. Our method, based upon the partial sampling of each flow (i.e., performing sampling at only early stages in each flow's lifetime), provides a sufficient reduction in total traffic (e.g., a factor of five in packets, a factor of ten in bytes) as to allow practical implementations at one Gigabit/s, and, using limited hardware assistance, ten Gigabit/s.Keywords
This publication has 18 references indexed in Scilit:
- Less hashing, same performance: Building a better Bloom filterRandom Structures & Algorithms, 2008
- The shuntPublished by Association for Computing Machinery (ACM) ,2007
- Traffic classification through simple statistical fingerprintingACM SIGCOMM Computer Communication Review, 2007
- A preliminary performance comparison of five machine learning algorithms for practical IP traffic flow classificationACM SIGCOMM Computer Communication Review, 2006
- Early application identificationPublished by Association for Computing Machinery (ACM) ,2006
- Building a time machine for efficient recording and retrieval of high-volume network trafficPublished by Association for Computing Machinery (ACM) ,2005
- Sampling for Passive Internet Measurement: A ReviewStatistical Science, 2004
- Bloom Filters in Probabilistic VerificationPublished by Springer Nature ,2004
- Network Applications of Bloom Filters: A SurveyInternet Mathematics, 2004
- Summary cache: a scalable wide-area Web cache sharing protocolIEEE/ACM Transactions on Networking, 2000