Tracking elephant flows in internet backbone traffic with an FPGA-based cache

Martin Zadnik*, Marco Canini, Andrew W. Moore, David J. Miller, Wei Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

This paper presents an FPGA-friendly approach to tracking elephant flows in network traffic. Our approach, Single Step Segmented Least Recently Used (S 3 -LRU) policy, is a network traffic-friendly replacement policy for maintaining flow states in a Naïve Hash Table (NHT). We demonstrate that our S 3 -LRU approach preserves elephant flows: conservatively promoting potential elephants and evicting low-rate flows in LRU manner. Our approach keeps flow-state of any elephant since start-of-day and provides a significant improvement over filtering approaches proposed in previous work. Our FPGA-based implementation of the S 3 -LRU in combination with an NHT suites well the parallel access to block memories while capitalising on the retuning of parameters through dynamic-reprogramming.

Original languageEnglish (US)
Title of host publicationFPL 09
Subtitle of host publication19th International Conference on Field Programmable Logic and Applications
Pages640-644
Number of pages5
DOIs
StatePublished - Nov 25 2009
EventFPL 09: 19th International Conference on Field Programmable Logic and Applications - Prague, Czech Republic
Duration: Aug 31 2009Sep 2 2009

Publication series

NameFPL 09: 19th International Conference on Field Programmable Logic and Applications

Other

OtherFPL 09: 19th International Conference on Field Programmable Logic and Applications
CountryCzech Republic
CityPrague
Period08/31/0909/2/09

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this