Resource/accuracy tradeoffs in software-defined measurement

Authors:
Masoud Moshref;Minlan Yu;Ramesh Govindan
Affiliations:
University of Southern California, Los Angeles, CA, USA;University of Southern California, Los Angeles, CA, USA;University of Southern California, Los Angeles, CA, USA
Venue:
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Year:
2013

Citing 19
Cited 1

Probabilistic counting algorithms for data base applications

Journal of Computer and System Sciences
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
Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
An improved data stream summary: the count-min sketch and its applications

Journal of Algorithms
On the Feasibility of Optical Circuit Switching for High Performance Computing Systems

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Adaptive Spatial Partitioning for Multidimensional Data Streams

Algorithmica
Finding hierarchical heavy hitters in data streams

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Finding frequent items in data streams

Proceedings of the VLDB Endowment
Safe and effective fine-grained TCP retransmissions for datacenter communication

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Helios: a hybrid electrical/optical switch architecture for modular data centers

Proceedings of the ACM SIGCOMM 2010 conference
Hedera: dynamic flow scheduling for data center networks

NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Uncovering Global Icebergs in Distributed Streams: Results and Implications

Journal of Network and Systems Management
ProgME: towards programmable network measurement

IEEE/ACM Transactions on Networking (TON)
Online measurement of large traffic aggregates on commodity switches

Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
Efficiently measuring bandwidth at all time scales

Proceedings of the 8th USENIX conference on Networked systems design and implementation
DevoFlow: scaling flow management for high-performance networks

Proceedings of the ACM SIGCOMM 2011 conference
MicroTE: fine grained traffic engineering for data centers

Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Sketch-based querying of distributed sliding-window data streams

Proceedings of the VLDB Endowment
Software defined traffic measurement with OpenSketch

nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation

An adaptive flow counting method for anomaly detection in SDN

Proceedings of the ninth ACM conference on Emerging networking experiments and technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previous work on network measurements have explored several primitives of increasing complexity for measurement tasks at individual nodes, ranging from counters to hashing to arbitrary code fragments. In an SDN network, these primitives may require significant bandwidth, memory and processing resources, and the resources dedicated to these can affect the accuracy of the eventual measurement. In this paper, we first qualitatively discuss the tradeoff space of resource usage versus accuracy for these different primitives as a function of the spatial and temporal measurement granularity, then quantify these tradeoffs in the context of hierarchical heavy hitter detection.