[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1109/ICDCS.2007.110guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Fast Algorithms for Heavy Distinct Hitters using Associative Memories

Published: 25 June 2007 Publication History

Abstract

Real-time detection of worm attacks, port scans and Distributed Denial of Service (DDoS) attacks, as network packets belonging to these security attacks flow through a network router, is of paramount importance. In a typical worm attack, a worm infected host tries to spread the worm by scanning a number of other hosts thus resulting in significant number of network connections at an intermediate router. Detecting such attacks amounts to finding all hosts that are associated with unusually high number of other hosts, which is equivalent to solving the classic heavy distinct hitter problem over data streams. While several heavy distinct hitter solutions have been proposed and evaluated in a standard CPU setting, most of the above applications typically execute on special networking architectures called Network Processing Units (NPUs). These NPUs interface with special associative memories known as the Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. In this paper, we describe how the integrated architecture of NPU and TCAMs can be exploited to develop high-speed solutions for heavy distinct hitters.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
ICDCS '07: Proceedings of the 27th International Conference on Distributed Computing Systems
June 2007
ISBN:0769528376

Publisher

IEEE Computer Society

United States

Publication History

Published: 25 June 2007

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2015)The correlation study for parameters in four tuplesInternational Journal of Ad Hoc and Ubiquitous Computing10.1504/IJAHUC.2015.06949219:1/2(38-49)Online publication date: 1-May-2015
  • (2014)How to catch L 2 -heavy-hitters on sliding windowsTheoretical Computer Science10.1016/j.tcs.2014.06.008554:C(82-94)Online publication date: 16-Oct-2014
  • (2014)Space-efficient tracking of persistent items in a massive data streamStatistical Analysis and Data Mining10.1002/sam.112147:1(70-92)Online publication date: 1-Feb-2014
  • (2011)Finding heavy distinct hitters in data streamsProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989541(299-308)Online publication date: 4-Jun-2011
  • (2008)Aggregate computation over data streamsProceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development10.5555/1791734.1791738(10-25)Online publication date: 26-Apr-2008
  • (2007)Fast data stream algorithms using associative memoriesProceedings of the 2007 ACM SIGMOD international conference on Management of data10.1145/1247480.1247510(247-256)Online publication date: 11-Jun-2007

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media