Generalized Sketch Families for Network Traffic Measurement
Authors:
Open Access
- 17 December 2019
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 3 (3) , 1-34
Abstract
Traffic measurement provides critical information for network management, resource allocation, traffic engineering, and attack detection. Most prior art has been geared towards specific application needs with specific performance objectives. To support diverse requirements with efficient and future-proof implementation, this paper takes a new approach to establish common frameworks, each for a family of traffic measurement solutions that share the same implementation structure, providing a high level of generality, for both size and spread measurements and for all flows. The designs support many options of performance-overhead tradeoff with as few as one memory update per packet and as little space as several bits per flow on average. Such a family-based approach will unify implementation by removing redundancy from different measurement tasks and support reconfigurability in a plug-n-play manner. We demonstrate the connection and difference in the design of these traffic measurement families and perform experimental comparisons on hardware/software platforms to find their tradeoff, which provide practical guidance for which solutions to use under given performance goals.Keywords
Funding Information
- National Science Foundation (CNS-1719222,STC-1562485)
This publication has 11 references indexed in Scilit:
- Cardinality Estimation for Elephant Flows: A Compact Solution Based on Virtual Register SharingIEEE/ACM Transactions on Networking, 2017
- Hyper-Compact Virtual Estimators for Big Network Data Based on Register Sharing2015
- Fit a Compact Spread Estimator in Small High-Speed MemoryIEEE/ACM Transactions on Networking, 2010
- Robust approximate aggregation in sensor data management systemsACM Transactions on Database Systems, 2009
- Probabilistic lossy countingACM SIGCOMM Computer Communication Review, 2008
- Bitmap Algorithms for Counting Active Flows on High-Speed LinksIEEE/ACM Transactions on Networking, 2006
- SYN-dog: sniffing SYN flooding sources2003
- Understanding BGP misconfigurationACM SIGCOMM Computer Communication Review, 2002
- Finding Frequent Items in Data Streams2002
- A linear-time probabilistic counting algorithm for database applicationsACM Transactions on Database Systems, 1990