A scalable architecture for maintaining packet latency measurements

Authors:
Myungjin Lee;Nick Duffield;Ramana Rao Kompella
Affiliations:
Purdue University, West Lafayette, IN, USA;AT&T Labs-Research, Florham Park, NJ, USA;Purdue University, West Lafayette, IN, USA
Venue:
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Year:
2012

Citing 4
Cited 0

Better streaming algorithms for clustering problems

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Not all microseconds are equal: fine-grained per-flow measurements with reference latency interpolation

Proceedings of the ACM SIGCOMM 2010 conference
Data center TCP (DCTCP)

Proceedings of the ACM SIGCOMM 2010 conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing). In this paper, to provide latency measurements at both finer (e.g., packet) as well as flexible (e.g., flow subsets) levels of granularity, we propose an architecture called MAPLE that essentially stores packet-level latencies in routers and allows network operators to query the latency of arbitrary traffic sub-populations. MAPLE is built using a scalable data structure called SVBF with small storage needs.