(Created page with " == Abstract == Identifying the "heavy hitter" flows or flows with large traffic volumes in the data plane is important for several applications e.g., flow-size aware routing...") |
m (Scipediacontent moved page Draft Content 542652077 to Narayana et al 2017a) |
(No difference)
|
Identifying the "heavy hitter" flows or flows with large traffic volumes in the data plane is important for several applications e.g., flow-size aware routing, DoS detection, and traffic engineering. However, measurement in the data plane is constrained by the need for line-rate processing (at 10-100Gb/s) and limited memory in switching hardware. We propose HashPipe, a heavy hitter detection algorithm using emerging programmable data planes. HashPipe implements a pipeline of hash tables which retain counters for heavy flows while evicting lighter flows over time. We prototype HashPipe in P4 and evaluate it with packet traces from an ISP backbone link and a data center. On the ISP trace (which contains over 400,000 flows), we find that HashPipe identifies 95% of the 300 heaviest flows with less than 80KB of memory.
Comment: SOSR 2017, Santa Clara, CA
The different versions of the original document can be found in:
DOIS: 10.1145/3050220.3050239 10.1145/3050220.3063772
Published on 01/01/2017
Volume 2017, 2017
DOI: 10.1145/3050220.3050239
Licence: Other
Are you one of the authors of this document?