Tracking Elephant Flows in Internet Backbone Traffic with an FPGA-based Cache

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU86219" target="_blank" >RIV/00216305:26230/09:PU86219 - isvavai.cz</a>
Alternative codes found
RIV/63839172:_____/09:00006811
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Tracking Elephant Flows in Internet Backbone Traffic with an FPGA-based Cache
Original language description
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 NaiveHash 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.
Czech name
—
Czech description
—

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
19th International Conference on Field Programmable Logic and Applications
ISBN
978-1-4244-3892-1
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
Institute of Electrical and Electronics Engineers
Place of publication
Prague
Event location
Prague
Event date
Aug 31, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)