Deriving traffic demands for operational IP networks: methodology and experience
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
New directions in traffic measurement and accounting
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
NetFlow: information loss or win?
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
What's hot and what's not: tracking most frequent items dynamically
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient implementation of a statistics counter architecture
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Automatically inferring patterns of resource consumption in network traffic
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Space-code bloom filter for efficient traffic flow measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
ACCEL-RATE: a faster mechanism for memory efficient per-flow traffic estimation
Proceedings of the joint international conference on Measurement and modeling of computer systems
Data streaming algorithms for efficient and accurate estimation of flow size distribution
Proceedings of the joint international conference on Measurement and modeling of computer systems
Approximate frequency counts over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Adaptive shared-state sampling
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
A Space-Efficient Fair Packet Sampling Algorithm
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Packet sampling for flow accounting: challenges and limitations
PAM'08 Proceedings of the 9th international conference on Passive and active network measurement
Traffic classification techniques supporting semantic networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Uncovering Global Icebergs in Distributed Streams: Results and Implications
Journal of Network and Systems Management
Efficient packet sampling for accurate traffic measurements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable identification and measurement of heavy-hitters
Computer Communications
| Hi-index | 0.00 |
We present an algorithm, Shared-State Sampling (S3), for the problem of detecting large flows in high-speed networks. While devised with different principles in mind, (S3) turns out to be a generalization of two existing algorithms tackling the same problem: Sample-and-Hold and Multistage Filters. S3 is found to outperform its predecessors, with the advantage of smoothly adapting to the memory technology available, to the extent of allowing a partial implementation in DRAM. (S3) exhibits mild tradeoffs between the different metrics of interest, which greatly benefits the scalability of the approach. The problem of detecting frequent items in streams appears in other areas. We also compare our algorithm with proposals appearing in the context of databases and regarded superior to the aforementioned. Our analysis and experimental results show that, among those evaluated, (S3) is the most attractive and scalable solution to the problem in the context of high-speed network measurements.