Publication Details
Tracking Elephant Flows in Internet Backbone Traffic with an FPGA-based Cache
heavy-hitter flow, cache, FPGA
This paper deals with design of FPGA-based flow cache for detecting and maintaining information about heavy-hitter flows.
This paper presents an FPGA-friendly approach to tracking elephant flows in network traffic. Our approach, Single Step Segmented Least Recently Used (S3-LRU) policy, is a network traffic-friendly replacement policy for maintaining flow states in a Naive Hash Table (NHT). We demonstrate that our S3-LRU approach preserves elephant flows: conservatively promoting potential elephants and evicting lowrate flows in LRU manner. Our approach keeps flow-state of any elephant since startof-day and provides a significant improvement over filtering approaches proposed in previous work. Our FPGA-based implementation of the S3-LRU in combination with an NHT suites well the parallel access to block memories while capitalising on the retuning of parameters through dynamic-reprogramming.
@INPROCEEDINGS{FITPUB9104, author = "Martin \v{Z}\'{a}dn\'{i}k and et al.", title = "Tracking Elephant Flows in Internet Backbone Traffic with an FPGA-based Cache", pages = "640--644", booktitle = "19th International Conference on Field Programmable Logic and Applications", year = 2009, location = "Prague, CZ", publisher = "Institute of Electrical and Electronics Engineers", ISBN = "978-1-4244-3892-1", language = "english", url = "https://www.fit.vut.cz/research/publication/9104" }