Counting distinct elements over sliding windows

Eran Assaf, Ran Ben Basat, Gil Einziger, Roy Friedman, Yaron Kassner

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

1 Scopus citations

Abstract

In Distributed Denial of Service (DDoS) attacks, an attacker tries to disable a service with a ood of seemingly legitimate requests from multiple devices; this is usually accompanied by a sharp spike in the number of distinct IP addresses/ows accessing the system in a short time frame. Hence, the number of distinct elements over sliding windows is a fundamental signal in DDoS identification. Additionally, assessing whether a specific ow has recently accessed the system, known as the Set Membership problem, can help us identify the attacking parties. Here, we show how to extend the functionality of a state of the art algorithm for set membership over a W elements sliding window. We now also support estimation of the distinct ow count, using as little as log2(W) additional bits.

Original languageEnglish
Title of host publicationSYSTOR 2017 - Proceedings of the 10th ACM International Systems and Storage Conference
PublisherAssociation for Computing Machinery, Inc
ISBN (Electronic)9781450350358
DOIs
StatePublished - 22 May 2017
Externally publishedYes
Event10th ACM International Systems and Storage Conference, SYSTOR 2017 - Haifa, Israel
Duration: 22 May 201724 May 2017

Publication series

NameSYSTOR 2017 - Proceedings of the 10th ACM International Systems and Storage Conference

Conference

Conference10th ACM International Systems and Storage Conference, SYSTOR 2017
Country/TerritoryIsrael
CityHaifa
Period22/05/1724/05/17

Fingerprint

Dive into the research topics of 'Counting distinct elements over sliding windows'. Together they form a unique fingerprint.

Cite this