Space efficient elephant flow detection

Ran Ben Basat, Gil Einziger, Roy Friedman

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

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.

Original languageEnglish
Title of host publicationSYSTOR 2018 - Proceedings of the 11th ACM International Systems and Storage Conference
PublisherAssociation for Computing Machinery, Inc
Pages115
Number of pages1
ISBN (Electronic)9781450358491
DOIs
StatePublished - 4 Jun 2018
Externally publishedYes
Event11th ACM International Systems and Storage Conference, SYSTOR 2018 - Haifa, Israel
Duration: 4 Jun 20186 Jun 2018

Publication series

NameSYSTOR 2018 - Proceedings of the 11th ACM International Systems and Storage Conference

Conference

Conference11th ACM International Systems and Storage Conference, SYSTOR 2018
Country/TerritoryIsrael
CityHaifa
Period4/06/186/06/18

Keywords

  • Elephant Flows
  • Network Measurement
  • Streaming

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Electrical and Electronic Engineering
  • Computer Science Applications

Cite this