@inproceedings{3d764ab28f4a43fe82798ac6764d3bde,
title = "Space efficient elephant flow detection",
abstract = "Identifying the large flows in terms of byte volume, known as elephant flows, is a fundamental capability that many network algorithms require. While optimal solutions that find the largest flows in terms of packet-count are known [5], constant update time algorithms for byte-volume were only recently discovered [1, 2]. Here, we propose an improved variant of the DIMSUM algorithm [2] that reduces the space requirement by 50\% while allowing O(1) update time.",
keywords = "Elephant Flows, Network Measurement, Streaming",
author = "Basat, \{Ran Ben\} and Gil Einziger and Roy Friedman",
note = "Publisher Copyright: {\textcopyright} 2018 Association for Computing Machinery.; 11th ACM International Systems and Storage Conference, SYSTOR 2018 ; Conference date: 04-06-2018 Through 06-06-2018",
year = "2018",
month = jun,
day = "4",
doi = "10.1145/3211890.3211919",
language = "American English",
series = "SYSTOR 2018 - Proceedings of the 11th ACM International Systems and Storage Conference",
pages = "115",
booktitle = "SYSTOR 2018 - Proceedings of the 11th ACM International Systems and Storage Conference",
}